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 A025311 #18 Jun 24 2025 12:55:26
%S A025311 138125,235625,276250,300625,308125,333125,393125,430625,435625,
%T A025311 471250,495625,552500,563125,593125,601250,616250,648125,666250,
%U A025311 670625,723125,743125,775625,786250,788125,820625,861250,871250,885625,918125,942500
%N A025311 Numbers that are the sum of 2 distinct nonzero squares in exactly 10 ways.
%C A025311 Where does this first differ from A025293? - _R. J. Mathar_, Jun 24 2025
%H A025311 Donovan Johnson, <a href="/A025311/b025311.txt">Table of n, a(n) for n = 1..1000</a>
%H A025311 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%t A025311 nn = 942500; 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, 10]] (* _T. D. Noe_, Apr 07 2011 *)
%Y A025311 Cf. A025293.
%K A025311 nonn
%O A025311 1,1
%A A025311 _David W. Wilson_