login
The OEIS is supported by the many generous donors to the OEIS 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
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
Sequence in context: A361466 A191747 A330323 * A133081 A352573 A285345
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)