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 A294713 #13 Nov 01 2019 22:21:48 %S A294713 594,626,629,734,846,914,926,929,1001,1026,1041,1097,1125,1190,1193, %T A294713 1209,1214,1229,1241,1265,1289,1326,1329,1382,1386,1409,1433,1490, %U A294713 1505,1509,1521,1530,1581,1637,1689,1691,1713,1725,1730,1739,1749,1754,1770,1778 %N A294713 Numbers that are the sum of three squares (square 0 allowed) in exactly ten ways. %C A294713 These are the numbers for which A000164(a(n)) = 10. %C A294713 a(n) is the n-th largest number which has a representation as a sum of three integer squares (square 0 allowed), in exactly ten 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 A294713 This sequence is a proper subsequence of A000378. %H A294713 Robert Price, <a href="/A294713/b294713.txt">Table of n, a(n) for n = 1..1835</a> %t A294713 Select[Range[0, 1000], Length[PowersRepresentations[#, 3, 2]] == 10 &] %Y A294713 Cf. A000164, A005875, A000378, A094942, A224442, A224443, A294577, A294594, A294595, A294710, A294711, A294712. %K A294713 nonn %O A294713 1,1 %A A294713 _Robert Price_, Nov 07 2017 %E A294713 Updated Mathematica program to Version 11. by _Robert Price_, Nov 01 2019