OFFSET
1,2
COMMENTS
Smallest nonnegative number that can be written as sum of distinct Fibonacci numbers in n ways would be the same, except starting with 0.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..5000
Marjorie Bicknell-Johnson and Daniel C. Fielder, The Least Number Having 331 Representations as a Sum of Distinct Fibonacci Numbers, Fibonacci Quarterly 39(2001), pp. 455-461.
Daniel C. Fielder and Marjorie Bicknell-Johnson, The First 330 Terms of Sequence A013583, Fibonacci Quarterly 39 (2001), pp. 75-84.
Petra Kocábová, Zuzana Masáková and Edita Pelantová, Integers with a maximal number of Fibonacci representations, RAIRO-Theor. Inf. Appl., Volume 39, Number 2, April-June 2005.
Paul K. Stockmeyer, A Smooth Tight Upper Bound for the Fibonacci Representation Function R(N), Fibonacci Quarterly, Volume 46/47, Number 2, May 2009.
F. V. Weinstein, Notes on Fibonacci Partitions, arXiv:math/0307150 [math.NT], 2003-2015.
FORMULA
A000119(a(n)) = n (for n>1).
EXAMPLE
1 = 1; 3 = 3 = 2 + 1; 8 = 8 = 5 + 3 = 5 + 2 + 1.
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Marjorie Bicknell-Johnson (marjohnson(AT)earthlink.net)
EXTENSIONS
Additional terms from Jeffrey Shallit
Extended to 600 terms by Daniel C. Fielder
Entries rechecked by David W. Wilson, Jun 18 2003
STATUS
approved