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 A025299 #23 Jun 03 2025 01:14:20
%S A025299 27625,32045,40885,45305,47125,55250,58565,60125,61625,64090,66625,
%T A025299 67405,69745,71825,77285,78625,80665,81770,86125,87125,90610,91205,
%U A025299 93925,94250,98345,98605,99125,99905,101065,107185,110500,111605,112625,114985
%N A025299 Numbers that are the sum of 2 nonzero squares in 8 or more ways.
%H A025299 David A. Corneth, <a href="/A025299/b025299.txt">Table of n, a(n) for n = 1..10000</a> (first 98 terms from Robert Price)
%H A025299 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A025299 27625 is in the sequence via 20^2 + 165^2 = 27^2 + 164^2 = 45^2 + 160^2 = 60^2 + 155^2 = 83^2 + 144^2 = 88^2 + 141^2 = 101^2 + 132^2 = 115^2 + 120^2. - _David A. Corneth_, Jun 01 2025
%t A025299 nn = 114985; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i}]; Flatten[Position[t, _?(# >= 8 &)]] (* _T. D. Noe_, Apr 07 2011 *)
%o A025299 (PARI) upto(n) = {my(v = vector(n)); for(i = 1, sqrtint(n), i2 = i^2; for(j = i, sqrtint(n - i^2), v[i2 + j^2]++)); select(x->x >= 8, v, 1)} \\ _David A. Corneth_, Jun 01 2025
%Y A025299 Cf. A025291, A025298, A025300, A025336.
%K A025299 nonn
%O A025299 1,1
%A A025299 _David W. Wilson_