A287656 Number of partitions of n into distinct tetranacci numbers (with a single type of 1) (A000078).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2

Offset: 0

Author

Ilya Gutkovskiy, Jun 05 2017

Keywords

• nonn

Examples

			a(15) = 2 because we have [15] and [8, 4, 2, 1].
		

Links

• Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
• Eric Weisstein's World of Mathematics, Tetranacci Number
• Index entries for related partition-counting sequences

Crossrefs

Cf. A000078, A000119, A000121, A003263, A117546, A288120.

Formula

G.f.: Product_{k>=4} (1 + x^A000078(k)).