login
A219490
Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 5, 2, 7, 9, 16, 25, ....
1
1, 0, 1, 0, 0, 1, 0, 2, 0, 2, 0, 1, 1, 0, 2, 0, 3, 0, 2, 0, 0, 2, 0, 3, 0, 3, 0, 2, 1, 0, 3, 0, 4, 0, 3, 0, 1, 2, 0, 3, 0, 4, 0, 3, 0, 0, 3, 0, 5, 0, 4, 0, 2, 2, 0, 4, 0, 5, 0, 3, 0, 0, 3, 0, 4, 0, 4, 0, 3, 1, 0, 4, 0, 6, 0, 5, 0, 2, 3, 0, 5, 0, 6, 0, 4, 0, 0, 4, 0, 6, 0, 5, 0, 3, 2, 0, 5, 0, 6, 0, 4
OFFSET
0,8
LINKS
J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498, in the issue dedicated to Aldo De Luca on the occasion of his 60th anniversary.
D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, part 1, part 2, Fib. Quart., 4 (1966), 289-306 and 322.
CROSSREFS
KEYWORD
nonn
AUTHOR
Casey Mongoven, Nov 20 2012
EXTENSIONS
a(0)=1 from Alois P. Heinz, Sep 16 2015
STATUS
approved