Abstract
Let F n denote the nth Fibonacci number, that is, F0 = 0, F1 = 1, F n = F n -1 + F n -2 for n ≥ 2. Let L n denote the nth Lucas number, that is, L0 = 2, L1 = 1, L n = L n -1 + L n -2 for n ≥ 2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cohn, J.H.E. “Square Fibonacci Numbers, etc.” The Fibonacci Quarterly, Vol. 2 (1964): pp. 109–113.
Hoggatt, Jr., V.E. Fibonacci and Lucas Numbers. Houghton Mifflin Co., Boston, 1969.
Kemnitz, A. “Punktmengen mit ganzzahligen Abständen.” Habilitationsschrift, Techn. Universität Braunschweig, 1988.
Robbins, N. “Fibonacci and Lucas Numbers of the Forms w2 - 1, w3 ± 1.” The Fibonacci Quarterly, Vol. 19 (1981): pp. 369–373.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Harborth, H., Kemnitz, A. (1990). Fibonacci Triangles. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1910-5_14
Download citation
DOI: https://doi.org/10.1007/978-94-009-1910-5_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7352-3
Online ISBN: 978-94-009-1910-5
eBook Packages: Springer Book Archive