|
|
A103344
|
|
Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 1, 4, 5, 9, 14, 23, 37, 60, ....
|
|
21
|
|
|
1, 1, 0, 0, 1, 2, 1, 0, 0, 2, 2, 0, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 0, 3, 3, 0, 0, 2, 4, 2, 0, 0, 3, 3, 0, 0, 1, 4, 3, 0, 0, 3, 5, 2, 0, 0, 4, 4, 0, 0, 2, 5, 3, 0, 0, 3, 4, 1, 0, 0, 4, 4, 0, 0, 3, 6, 3, 0, 0, 5, 5, 0, 0, 2, 6, 4, 0, 0, 4, 6, 2, 0, 0, 5, 5, 0, 0, 3, 6, 3, 0, 0, 4, 4, 0, 0, 1, 5, 4, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
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.
|
|
MATHEMATICA
|
imax = 10;
f[1] = 1; f[2] = 4; f[n_] := f[n] = f[n-1] + f[n-2];
p = Product[1+x^f[i], {i, 1, imax}];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|