OFFSET
0,2
COMMENTS
Number of ways to write n as an ordered sum of 15 icosahedral numbers (A006564).
Pollock conjectured that every number is the sum of at most 5 tetrahedral numbers and that every number is the sum of at most 7 octahedral numbers.
Conjecture: a(n) > 0 for all n >= 0.
Extended conjecture: every number is the sum of at most 15 icosahedral numbers.
LINKS
Ilya Gutkovskiy, Extended graphical example
FORMULA
G.f.: (Sum_{k>=0} x^(k*(5*k^2-5*k+2)/2))^15.
MATHEMATICA
nmax = 47; CoefficientList[Series[Sum[x^(k (5 k^2 - 5 k + 2)/2), {k, 0, nmax}]^15, {x, 0, nmax}], x]
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 12 2017
STATUS
approved