An algorithm for determining \(R(N)\) from the subscripts of the Zeckendorf representation of \(N\) (Q2735223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for determining \(R(N)\) from the subscripts of the Zeckendorf representation of \(N\) |
scientific article; zbMATH DE number 1640214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for determining \(R(N)\) from the subscripts of the Zeckendorf representation of \(N\) |
scientific article; zbMATH DE number 1640214 |
Statements
30 August 2001
0 references
representations by Fibonacci numbers
0 references
Zeckendorf representation
0 references
recursive algorithm
0 references
An algorithm for determining \(R(N)\) from the subscripts of the Zeckendorf representation of \(N\) (English)
0 references
Let \(R(N)\) be the number of representations of the positive integer \(N\) as the sum of distinct Fibonacci numbers. \(N\) has a unique Zeckendorf representation in which no two consecutive Fibonacci numbers appear in the sum. In this paper a simple recursive algorithm for determining \(R(N)\) solely from the subscripts of the Zeckendorf representation of \(N\) is given.
0 references
