

A241948


Number of possible representations of n as a sum of distinct positive integers from the Fibonaccitype sequences 0,1,1,2,3,5,8,13,... and 0,2,2,4,6,10,16,... (A000045 and A118658).


1



1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 7, 8, 8, 10, 11, 12, 14, 14, 16, 18, 18, 21, 22, 23, 26, 26, 29, 31, 32, 35, 36, 39, 41, 41, 46, 47, 49, 53, 52, 57, 60, 60, 65, 66, 70, 74, 73, 79, 81, 84, 89, 88, 94, 97, 97, 105, 105, 109, 115, 113, 121, 124, 125, 132, 132, 139, 143, 141, 151, 152, 157, 164, 161, 171, 175
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


LINKS

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


EXAMPLE

a(10) = 7 because 10 can be represented in 7 possible ways as a sum of integers in the set {1,2,3,4,5,6,8,10,13,16,...}: 10, 8+2, 6+4, 6+3+1, 5+4+1, 5+3+2, 4+3+2+1.


CROSSREFS

Cf. A118658, A000045, A000119.
Sequence in context: A103354 A127038 A175268 * A051068 A050294 A349775
Adjacent sequences: A241945 A241946 A241947 * A241949 A241950 A241951


KEYWORD

nonn


AUTHOR

Casey Mongoven, May 03 2014


EXTENSIONS

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


STATUS

approved



