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

Author

Ilya Gutkovskiy, Jan 04 2023

Keywords

• nonn

Examples

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

Crossrefs

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