

A116402


Number of representations of n as a sum of distinct elements of the Fibonaccitype sequence beginning 1, 5, 6, 11, 17, ...


2



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



OFFSET

0,7


LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..14517
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.
Casey Mongoven, Y(n) Rep Sequence no. 1; electronic music created with this sequence.


CROSSREFS

Cf. A022095, A116403, A000121.
Sequence in context: A073253 A004198 A324351 * A093323 A106278 A177517
Adjacent sequences: A116399 A116400 A116401 * A116403 A116404 A116405


KEYWORD

nonn


AUTHOR

Casey Mongoven, Feb 13 2006


EXTENSIONS

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


STATUS

approved



