This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A282350 #5 Feb 12 2017 21:08:01
%S A282350 1,15,105,455,1365,3003,5005,6435,6435,5005,3003,1365,470,315,1380,
%T A282350 5461,15015,30030,45045,51480,45045,30030,15015,5460,1470,1575,8205,
%U A282350 30030,75075,135135,180180,180180,135135,75075,30030,8190,1820,5565,30030,100100,225225,360360,420420,360360,225225,100100,30030,5460
%N A282350 Expansion of (Sum_{k>=0} x^(k*(5*k^2-5*k+2)/2))^15.
%C A282350 Number of ways to write n as an ordered sum of 15 icosahedral numbers (A006564).
%C A282350 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.
%C A282350 Conjecture: a(n) > 0 for all n >= 0.
%C A282350 Extended conjecture: every number is the sum of at most 15 icosahedral numbers.
%H A282350 Ilya Gutkovskiy, <a href="/A282350/a282350.pdf">Extended graphical example</a>
%F A282350 G.f.: (Sum_{k>=0} x^(k*(5*k^2-5*k+2)/2))^15.
%t A282350 nmax = 47; CoefficientList[Series[Sum[x^(k (5 k^2 - 5 k + 2)/2), {k, 0, nmax}]^15, {x, 0, nmax}], x]
%Y A282350 Cf. A006564, A282172, A282349.
%K A282350 nonn
%O A282350 0,2
%A A282350 _Ilya Gutkovskiy_, Feb 12 2017