login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280933 Expansion of Product_{k>=2} (1 + x^(Fibonacci(k)^2)). 1
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 (list; graph; refs; listen; history; text; internal format)
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: A214284 A191747 A330323 * A133081 A285345 A125999

Adjacent sequences:  A280930 A280931 A280932 * A280934 A280935 A280936

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Jan 11 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 17:17 EDT 2020. Contains 336439 sequences. (Running on oeis4.)