The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A294624 Number of partitions of n into distinct generalized octagonal numbers (A001082). 2
1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 2, 2, 0, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2, 1, 0, 1, 2, 1, 1, 2, 2, 1, 0, 2, 3, 1, 1, 2, 2, 1, 0, 1, 3, 2, 2, 3, 1, 1, 1, 3, 5, 2, 2, 3, 2, 2, 1, 3, 5, 2, 1, 3, 3, 2, 1, 3, 6, 3, 1, 3, 4, 3, 1, 4, 7, 3, 0, 3, 6, 4, 1, 2, 7, 5, 2, 4, 5, 5, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,22
LINKS
Eric Weisstein's World of Mathematics, Octagonal Number
FORMULA
G.f.: Product_{k>=1} (1 + x^(k*(3*k-2)))*(1 + x^(k*(3*k+2))).
EXAMPLE
a(21) = 2 because we have [21] and [16, 5].
MATHEMATICA
nmax = 100; CoefficientList[Series[Product[(1 + x^(k (3 k - 2))) (1 + x^(k (3 k + 2))), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A174294 A089385 A124407 * A290531 A206442 A137581
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Nov 05 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 May 25 09:14 EDT 2024. Contains 372786 sequences. (Running on oeis4.)