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 A025309 #17 Jul 06 2025 08:44:15
%S A025309 27625,32045,40885,45305,47125,55250,58565,60125,61625,64090,66625,
%T A025309 67405,69745,77285,78625,80665,81770,86125,87125,90610,91205,94250,
%U A025309 98345,98605,99125,99905,101065,107185,110500,111605,112625,114985,117130,118625
%N A025309 Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.
%C A025309 Starts to differ from A025291 at a(95). - _R. J. Mathar_, Jul 06 2025
%H A025309 Donovan Johnson, <a href="/A025309/b025309.txt">Table of n, a(n) for n = 1..1000</a>
%H A025309 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%t A025309 nn = 118625; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i - 1}]; Flatten[Position[t, 8]] (* _T. D. Noe_, Apr 07 2011 *)
%K A025309 nonn
%O A025309 1,1
%A A025309 _David W. Wilson_