A241950 Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences 0,2,2,4,6,10,16,... and 0,3,3,6,9,15,... (A118658 and A022086).
1, 0, 1, 1, 1, 1, 2, 1, 1, 3, 2, 2, 3, 3, 2, 5, 4, 3, 5, 6, 4, 6, 6, 4, 7, 8, 7, 7, 10, 8, 10, 11, 9, 10, 12, 12, 11, 13, 11, 14, 14, 15, 15, 16, 17, 19, 18, 17, 20, 19, 20, 22, 22, 20, 26, 25, 23, 27, 27, 25, 29, 30, 24, 31, 30, 29, 31, 34, 32, 35, 39, 34, 39, 39, 39, 39, 42, 39, 44, 44, 43, 47, 47, 48, 51, 51, 48, 56, 52, 53, 55, 56, 54, 61, 62, 56, 66
Offset: 0
Keywords
Examples
a(9) = 3 because 9 can be represented in 3 possible ways as a sum of integers in the set {2,3,4,6,9,10,15,16,...}: 9, 6+3, 4+3+2.
Links
- Alois P. Heinz, Table of n, a(n) for n = 0..20000
- 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.
Extensions
a(0)=1 from Alois P. Heinz, Sep 16 2015