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 A080917 #22 Sep 30 2018 07:06:29
%S A080917 1,2,2,4,2,0,4,0,4,10,4,12,8,0,8,0,6,16,6,12,8,0,4,0,8,10,12,16,0,0,8,
%T A080917 0,12,16,8,24,10,0,12,0,8,32,8,12,24,0,8,0,8,18,14,24,8,0,16,0,16,16,
%U A080917 4,36,0,0,16,0,6,32,16,12,16,0,8,0,12,16,20,28,24,0,8,0,24,34,8,36,16,0
%N A080917 Number of integer solutions to the equation 2*x^2 + y^2 + 8*z^2 = n.
%H A080917 Seiichi Manyama, <a href="/A080917/b080917.txt">Table of n, a(n) for n = 0..10000</a>
%H A080917 J. B. Tunnell, <a href="http://dx.doi.org/10.1007/BF01389327">A classical Diophantine problem and modular forms of weight 3/2</a>, Invent. Math., 72 (1983), 323-334.
%F A080917 Euler transform of period-32 sequence [2, -1, 2, -4, 2, -1, 2, 0, 2, -1, 2, -4, 2, -1, 2, -5, 2, -1, 2, -4, 2, -1, 2, 0, 2, -1, 2, -4, 2, -1, 2, -3, ...].
%F A080917 G.f.: theta_3(q) * theta_3(q^2) * theta_3(q^8).
%F A080917 a(2*n - 1) = A072068(n). a(2*n) = A033717(n).
%e A080917 G.f. = 1 + 2*q + 2*q^2 + 4*q^3 + 2*q^4 + 4*q^6 + 4*q^8 + 10*q^9 + 4*q^10 + ...
%t A080917 a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q] EllipticTheta[ 3, 0, q^2] EllipticTheta[ 3, 0, q^8], {q, 0, n}]; (* _Michael Somos_, Feb 19 2015 *)
%o A080917 (PARI) {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A)^3 * eta(x^4 + A)^3 * eta(x^16 + A)^5 / (eta(x + A) * eta(x^8 + A)^2 * eta(x^32 + A))^2, n))};
%Y A080917 Cf. A000122 (theta_3(q)), A033717, A072068, A080918.
%K A080917 nonn
%O A080917 0,2
%A A080917 _Michael Somos_, Feb 23 2003