A241949 Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences 0,1,1,2,3,5,8,13,... and 0,3,3,6,9,15,... (A000045 and A022086).

1, 1, 1, 2, 1, 2, 3, 2, 4, 5, 4, 6, 5, 5, 8, 8, 9, 10, 10, 10, 11, 12, 13, 15, 18, 16, 17, 19, 17, 22, 24, 22, 26, 26, 24, 29, 28, 30, 34, 35, 35, 35, 38, 38, 41, 46, 43, 46, 52, 46, 52, 54, 51, 59, 60, 58, 63, 63, 64, 67, 68, 71, 71, 80, 78, 76, 85, 80, 84, 96, 87, 94, 102, 93, 102, 102, 101, 111, 114, 115, 115, 117, 121, 119, 129

Offset

0,4

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.

Example

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

Crossrefs

Cf. A022086, A000045, A000119.

Sequence in context: A082304 A321664 A250099 * A288126 A214720 A035368

Adjacent sequences: A241946 A241947 A241948 * A241950 A241951 A241952

Keyword

nonn

Author

Casey Mongoven, May 03 2014

Extensions

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

Status

approved