A104450 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 3, 2, 5, 7, 12, 19, 31, 50, ....

1, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 3, 0, 2, 2, 0, 3, 0, 3, 1, 2, 3, 0, 4, 0, 3, 2, 1, 3, 0, 4, 0, 3, 3, 0, 5, 0, 4, 2, 2, 4, 0, 5, 0, 3, 3, 0, 4, 0, 4, 1, 3, 4, 0, 6, 0, 5, 3, 2, 5, 0, 6, 0, 4, 4, 0, 6, 0, 5, 2, 3, 5, 0, 6, 0, 4, 3, 1, 4, 0, 5, 0, 4, 4, 0, 7, 0, 6, 3, 3, 6, 0, 8, 0, 5, 5, 0, 7, 0, 6, 2, 4, 6, 0

Offset: 0

Author

Casey Mongoven, Mar 08 2005

Keywords

• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..16114
• 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.
• Ron Knott, Ron Knott's Sequence Visualiser.

Crossrefs

Cf. A013655.

Extensions

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