login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A241952
Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences 2,1,3,4,7,11,... and 0,2,2,4,6,10,16,... (A000032 and A118658).
0
1, 1, 2, 2, 2, 3, 4, 3, 4, 6, 6, 6, 8, 8, 7, 10, 11, 11, 12, 14, 15, 15, 17, 17, 17, 19, 21, 22, 24, 25, 26, 28, 29, 30, 31, 34, 35, 36, 40, 40, 39, 43, 44, 44, 47, 50, 52, 53, 57, 58, 58, 61, 63, 65, 68, 70, 73, 76, 76, 80, 81, 82, 86, 88, 92, 93, 95, 99, 99, 101, 104, 105, 108, 111, 115, 118, 119, 124, 126, 127, 133, 134, 137, 142, 143, 149
OFFSET
1,3
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.
EXAMPLE
a(10) = 6 because 10 can be represented in 6 possible ways as a sum of integers in the set {1,2,3,4,6,7,10,11,16,...}: 10, 7+3, 7+2+1, 6+4, 6+3+1, 4+3+2+1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Casey Mongoven, May 03 2014
STATUS
approved