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!)
A298246 Expansion of Product_{k>=1} (1 + x^(k*(k+1)*(2*k+1)/6)). 4
1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,92
COMMENTS
Number of partitions of n into distinct square pyramidal numbers.
LINKS
Eric Weisstein's World of Mathematics, Square Pyramidal Number
FORMULA
G.f.: Product_{k>=1} (1 + x^A000330(k)).
EXAMPLE
a(91) = 2 because we have [91] and [55, 30, 5, 1].
MATHEMATICA
nmax = 104; CoefficientList[Series[Product[1 + x^(k (k + 1) (2 k + 1)/6), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A015624 A015114 A016219 * A279024 A213731 A299197
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 15 2018
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)