A359512 Number of partitions of n into at most 3 positive Fibonacci numbers (with a single type of 1).

1, 1, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 4, 3, 4, 3, 1, 4, 2, 4, 4, 2, 4, 3, 2, 4, 1, 3, 1, 0, 4, 2, 3, 4, 2, 4, 2, 1, 4, 2, 3, 2, 0, 4, 1, 1, 3, 0, 1, 0, 0, 4, 2, 3, 3, 2, 4, 2, 1, 4, 1, 2, 1, 0, 4, 2, 2, 3, 0, 2, 0, 0, 4, 1, 1, 1, 0, 3, 0, 0, 1, 0, 0, 0, 0, 4, 2, 3, 3

Offset

0,3

Links

Table of n, a(n) for n=0..92.

Formula

a(n) = Sum_{k=0..3} A319394(n,k). - Alois P. Heinz, Jan 03 2023

Crossrefs

Cf. A000045, A003107, A319394, A319396, A359511, A359513, A359515.

Sequence in context: A343754 A327551 A205324 * A213253 A132983 A348182

Adjacent sequences: A359509 A359510 A359511 * A359513 A359514 A359515

Keyword

nonn

Author

Ilya Gutkovskiy, Jan 03 2023

Status

approved