

A104451


Number of representations of n as a sum of distinct elements of the Fibonaccitype sequence beginning 2, 5, 7, 12, 19, 31, 50, 81, ....


1



1, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 2, 0, 2, 0, 0, 1, 0, 3, 0, 2, 0, 0, 2, 0, 3, 0, 1, 0, 0, 3, 0, 3, 0, 0, 2, 0, 4, 0, 2, 0, 0, 3, 0, 3, 0, 0, 1, 0, 4, 0, 3, 0, 0, 3, 0, 5, 0, 2, 0, 0, 4, 0, 4, 0, 0, 2, 0, 5, 0, 3, 0, 0, 3, 0, 4, 0, 1, 0, 0, 4, 0, 4, 0, 0, 3, 0, 6, 0, 3, 0, 0, 5, 0, 5, 0, 0, 2, 0, 6, 0, 4, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,8


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. 491498, 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), 289306 and 322.
Ron Knott, Ron Knott's Sequence Visualiser.


CROSSREFS

Cf. A001060.
Sequence in context: A285709 A080101 A025895 * A285680 A240668 A106602
Adjacent sequences: A104448 A104449 A104450 * A104452 A104453 A104454


KEYWORD

nonn,look


AUTHOR

Casey Mongoven, Mar 08 2005


EXTENSIONS

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


STATUS

approved



