Fibonacci Triangles

Heiko Harborth and Arnfried Kemnitz

A chapter in Applications of Fibonacci Numbers, 1990, pp 129-132 from Springer

Abstract: Abstract Let F n denote the n th Fibonacci number, that is, F0 = 0, F1 = 1, F n = F n -1 + F n -2 for n ≥ 2. Let L n denote the n th Lucas number, that is, L0 = 2, L1 = 1, L n = L n -1 + L n -2 for n ≥ 2.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-1910-5_14

Ordering information: This item can be ordered from
http://www.springer.com/9789400919105

DOI: 10.1007/978-94-009-1910-5_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().