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!)
A280719 Expansion of (Sum_{k>=0} x^(k*(2*k-1)))^6. 2
1, 6, 15, 20, 15, 6, 7, 30, 60, 60, 30, 6, 15, 60, 90, 66, 45, 60, 80, 90, 66, 50, 120, 180, 135, 60, 15, 60, 186, 210, 141, 126, 120, 126, 165, 180, 241, 300, 210, 90, 90, 180, 270, 270, 210, 212, 270, 270, 200, 210, 366, 450, 390, 270, 135, 210, 375, 360, 396, 420, 300, 330, 375, 380, 510, 480, 336, 450, 510, 390, 330 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Number of ways to write n as an ordered sum of 6 hexagonal numbers (A000384).
a(n) > 0 for all n >= 0.
Every number is the sum of at most 6 hexagonal numbers.
Every number is the sum of at most k k-gonal numbers (Fermat's polygonal number theorem).
LINKS
Eric Weisstein's World of Mathematics, Hexagonal Number
FORMULA
G.f.: (Sum_{k>=0} x^(k*(2*k-1)))^6.
EXAMPLE
a(6) = 7 because we have:
[6, 0, 0, 0, 0, 0]
[0, 6, 0, 0, 0, 0]
[0, 0, 6, 0, 0, 0]
[0, 0, 0, 6, 0, 0]
[0, 0, 0, 0, 6, 0]
[0, 0, 0, 0, 0, 6]
[1, 1, 1, 1, 1, 1]
MATHEMATICA
nmax = 70; CoefficientList[Series[Sum[x^(k (2 k - 1)), {k, 0, nmax}]^6, {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A063266 A131892 A291381 * A282173 A328226 A045848
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 10 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 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)