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 A294710 #14 Nov 01 2019 22:21:29 %S A294710 306,314,341,441,450,458,494,506,581,585,593,605,654,657,674,698,706, %T A294710 726,731,738,746,773,806,842,850,873,890,891,893,894,899,901,905,906, %U A294710 934,978,985,998,1011,1013,1019,1050,1058,1061,1067,1073,1086,1094,1101 %N A294710 Numbers that are the sum of three squares (square 0 allowed) in exactly seven ways. %C A294710 These are the numbers for which A000164(a(n)) = 7. %C A294710 a(n) is the n-th largest number which has a representation as a sum of three integer squares (square 0 allowed), in exactly seven 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 A294710 This sequence is a proper subsequence of A000378. %H A294710 Robert Price, <a href="/A294710/b294710.txt">Table of n, a(n) for n = 1..988</a> %t A294710 Select[Range[0, 1000], Length[PowersRepresentations[#, 3, 2]] == 7 &] %Y A294710 Cf. A000164, A005875, A000378, A094942, A224442, A224443, A294577, A294594, A294595. %K A294710 nonn %O A294710 1,1 %A A294710 _Robert Price_, Nov 07 2017 %E A294710 Updated Mathematica program to Version 11. by _Robert Price_, Nov 01 2019