A280933 Expansion of Product_{k>=2} (1 + x^(Fibonacci(k)^2)).

1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0

Offset

0

Comments

Number of partitions of n into distinct squares of Fibonacci numbers (with a single type of 1).

Links

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

Index entries for sequences related to sums of squares

Index entries for related partition-counting sequences

Formula

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

Example

a(10) = 1 because we have [9, 1].

Mathematica

CoefficientList[Series[Product[1 + x^Fibonacci[k]^2, {k, 2, 20}], {x, 0, 105}], x]

Crossrefs

Cf. A000119, A000121, A003107, A007598, A239002, A033461, A280168.

Sequence in context: A361466 A191747 A330323 * A133081 A352573 A285345

Adjacent sequences: A280930 A280931 A280932 * A280934 A280935 A280936

Keyword

nonn

Author

Ilya Gutkovskiy, Jan 11 2017

Status

approved