The Zeckendorf-Wythoff Array Applied to Counting the Number of Representations of N as Sums of Distinct Fibonacci Numbers
Marjorie Bicknell-Johnson
A chapter in Applications of Fibonacci Numbers, 1999, pp 53-60 from Springer
Abstract:
Abstract Let R(N) be the number of representations of the non-negative integer N as a sum of distinct Fibonacci numbers. The Zeckendorf representation of N is the unique representation of N as the sum of distinct Fibonacci numbers, using no two consecutive Fibonacci numbers. Recursive relationships for computing R(N) from the Zeckendorf representation of N appear in
Keywords: 11B39; 11B37; 11Y55 (search for similar items in EconPapers)
Date: 1999
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-011-4271-7_6
Ordering information: This item can be ordered from
http://www.springer.com/9789401142717
DOI: 10.1007/978-94-011-4271-7_6
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 ().