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 A173681 #18 Aug 02 2017 10:36:13
%S A173681 1,8,28,56,70,56,28,8,9,56,168,280,280,168,56,8,28,168,420,560,420,
%T A173681 168,28,0,56,280,560,568,336,224,280,280,238,336,428,336,406,840,1120,
%U A173681 840,392,224,168,224,840,1680,1680,840,196,56,28,280,1120,1680,1148,448,428,568,420,448,868,840,448,840,1689,1736,1008,616,616,336,476,1688,2576
%N A173681 Number of ways of writing n as a sum of 8 nonnegative cubes.
%C A173681 Order matters. This is the coefficient of q^n in the expansion of {Sum_{m>=0} q^(m^3)}^8.
%H A173681 Seiichi Manyama, <a href="/A173681/b173681.txt">Table of n, a(n) for n = 0..10000</a>
%H A173681 L. E. Dickson, <a href="http://dx.doi.org/10.1090/S0002-9904-1939-07041-9">All integers except 23 and 239 are sums of eight cubes</a>, Bull. Amer. Math. Soc. 45 (1939), 588-591.
%o A173681 (PARI) lista(n)=my(q='q); Vec(sum(m=0, (n+.5)^(1/3), q^(m^3), O(q^(n+1)))^8); \\ _Michel Marcus_, Apr 12 2016
%Y A173681 Cf. A004830, A173677.
%Y A173681 Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682.
%K A173681 nonn
%O A173681 0,2
%A A173681 _N. J. A. Sloane_, Nov 25 2010