login
A219479
Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 1, 6, 7, 13, 20, 33, 53, ....
1
1, 1, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 1, 3, 2, 0, 0, 0, 0, 2, 3, 1, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 2, 4, 2, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 1, 4, 3, 0, 0, 0, 0, 3, 5, 2, 0, 0, 0, 0, 4, 4, 0, 0, 0, 0, 2, 5, 3, 0, 0, 0, 0, 3, 4, 1, 0, 0, 0, 0, 4, 4, 0, 0, 0, 0, 3, 6, 3, 0, 0, 0, 0, 5, 5
OFFSET
0,8
REFERENCES
J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498.
CROSSREFS
KEYWORD
nonn
AUTHOR
Casey Mongoven, Nov 20 2012
EXTENSIONS
a(0)=1 from Alois P. Heinz, Sep 16 2015
STATUS
approved