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,16

Links

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

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

Formula

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

Example

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

Crossrefs

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

Sequence in context: A212177 A345999 A249622 * A043286 A172098 A353801

Adjacent sequences: A287653 A287654 A287655 * A287657 A287658 A287659

Keyword

nonn

Author

Ilya Gutkovskiy, Jun 05 2017

Status

approved