[go: up one dir, main page]

login
A219496
Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 8, 1, 9, 10, 19, 29, 48, ....
1
1, 1, 0, 0, 0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 1, 2, 3, 2, 0, 0, 0, 0, 0, 0, 2, 3, 3, 2, 0, 0, 0, 0, 0, 1, 3, 4, 3, 1, 0, 0, 0, 0, 0, 2, 3, 4, 3, 0, 0, 0, 0, 0, 0, 3, 5, 4, 2, 0, 0, 0, 0, 0, 2, 4, 5, 3, 0, 0, 0, 0, 0, 0, 3, 4, 4, 3, 0, 0, 0, 0, 0, 1, 4, 6, 5, 2, 0, 0, 0, 0, 0, 3, 5, 6, 4, 0, 0, 0
OFFSET
0,10
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