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 A025310 #17 Jun 24 2025 12:54:44
%S A025310 71825,93925,122525,143650,156325,173225,187850,209525,223925,244205,
%T A025310 245050,257725,267325,273325,287300,296225,308425,312650,346450,
%U A025310 357425,375700,376025,382925,409825,419050,426725,440725,444925,447850,460525
%N A025310 Numbers that are the sum of 2 distinct nonzero squares in exactly 9 ways.
%C A025310 Where does this first differ from A025292? - _R. J. Mathar_, Jun 24 2025
%H A025310 Donovan Johnson, <a href="/A025310/b025310.txt">Table of n, a(n) for n = 1..1000</a>
%H A025310 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%t A025310 nn = 460525; 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, 9]] (* _T. D. Noe_, Apr 07 2011 *)
%K A025310 nonn
%O A025310 1,1
%A A025310 _David W. Wilson_