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 A333173 #9 Mar 10 2020 02:47:59
%S A333173 8,24,48,144,144,336,304,744,672,1008,816,1488,1440,2592,1584,2736,
%T A333173 2064,4320,3472,4368,3216,6048,4704,7776,4624,7536,5424,10656,7584,
%U A333173 10128,7776,12768,10416,15840,10080,14736,10384,19872,14736,18288,12816,20904,16992,28272
%N A333173 a(n) = r_4(n^2 + 1), where r_4(k) is the number of ways of writing k as a sum of 4 squares (A000118).
%H A333173 Amiram Eldar, <a href="/A333173/b333173.txt">Table of n, a(n) for n = 0..10000</a>
%H A333173 R. Sitaramachandrarao and P. V. Krishnaiah, <a href="https://doi.org/10.1016/0022-314X(86)90086-7">On the sums Sigma_{n<=x} A(f(n)) and Sigma_{p<=x} A(f(p))</a>, Journal of Number Theory, Vol. 23, No. 2 (1986), pp. 149-168.
%F A333173 a(n) = A000118(A002522(n)).
%e A333173 a(0) = r_4(0^2 + 1) = r_4(1) = A000118(1) = 8.
%t A333173 Table[SquaresR[4, k^2 + 1], {k, 0, 100}]
%Y A333173 Cf. A000118, A002522 A193432, A193433, A333167, A333169.
%K A333173 nonn
%O A333173 0,1
%A A333173 _Amiram Eldar_, Mar 09 2020