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 A294711 #15 Nov 01 2019 22:21:35 %S A294711 369,374,446,461,486,509,530,549,566,621,641,666,677,686,710,749,770, %T A294711 789,797,818,821,825,833,849,869,882,902,945,954,962,969,971,981,1010, %U A294711 1014,1017,1022,1029,1069,1085,1098,1146,1157,1174,1221,1233,1242,1245 %N A294711 Numbers that are the sum of three squares (square 0 allowed) in exactly eight ways. %C A294711 These are the numbers for which A000164(a(n)) = 8. %C A294711 a(n) is the n-th largest number which has a representation as a sum of three integer squares (square 0 allowed), in exactly eight ways, if neither the order of terms nor the signs of the numbers to be squared are taken into account. The multiplicity of a(n) with order and signs taken into account is A005875(a(n)). %C A294711 This sequence is a proper subsequence of A000378. %H A294711 Robert Price, <a href="/A294711/b294711.txt">Table of n, a(n) for n = 1..1701</a> %t A294711 Select[Range[0, 1000], Length[PowersRepresentations[#, 3, 2]] == 8 &] %Y A294711 Cf. A000164, A005875, A000378, A094942, A224442, A224443, A294577, A294594, A294595, A294710. %K A294711 nonn %O A294711 1,1 %A A294711 _Robert Price_, Nov 07 2017 %E A294711 Updated Mathematica program to Version 11. by _Robert Price_, Nov 01 2019