A359537 Number of partitions of n into at most 2 distinct positive Fibonacci numbers (with a single type of 1).

1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1

Offset

0,4

Links

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

Example

a(8) = 2 because we have [8] and [5, 3].

Crossrefs

Cf. A000045, A000119, A357731, A359511, A359514, A359538, A359539.

Sequence in context: A076348 A263835 A113310 * A081653 A249615 A096860

Adjacent sequences: A359534 A359535 A359536 * A359538 A359539 A359540

Keyword

nonn

Author

Ilya Gutkovskiy, Jan 04 2023

Status

approved