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, 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

Author

Casey Mongoven, Nov 20 2012

Keywords

• nonn

References

• J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498.

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..17101
• D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, Fib. Quart., 4 (1966), 289-306 and 322.
• C. Mongoven, Musical Composition Based on This Sequence.

Crossrefs

Cf. A000121, A000119, A067595, A003263, A103344.

Extensions

a(0)=1 from Alois P. Heinz, Sep 16 2015