The Generalized Fibonacci Numbers {Cn}, Cn = Cn-1 + Cn-2 + K

Marjorie Bicknell-Johnson and Gerald E. Bergum

A chapter in Applications of Fibonacci Numbers, 1988, pp 193-205 from Springer

Abstract: Abstract There are many ways to generalize the well-known Fibonacci sequence {Fn}, Fn = Fn-1 + Fn-2, F1 = 1, F2 = 1. In a personal letter dated December 18, 1985, Frank Harary asked one of the authors if they had ever encountered Cn = Cn-1 + Cn-2 + 1, which was used by Harary in connection with something he was counting involving Boolean Algebras. In fact, in Harary’s research it was noticed that the value of one could be replaced by any integer k.

Keywords: Generalize Sequence; Limit Theorem; Representation Point; Special Sequence; FIBONACCI Number (search for similar items in EconPapers)
Date: 1988
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-015-7801-1_18

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

DOI: 10.1007/978-94-015-7801-1_18

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 ().