A219481 Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 1, 8, 9, 17, 26, ....

1, 1, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 1, 3, 2, 0, 0, 0, 0, 0, 0, 2, 3, 1, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 2, 4, 2, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 1, 4, 3, 0, 0, 0, 0, 0, 0, 3, 5, 2, 0, 0, 0, 0, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 2, 5, 3, 0, 0, 0, 0

Offset: 0

Author

Casey Mongoven, Nov 20 2012

Keywords

• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..13763
• 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

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

Extensions

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