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 A025313 #29 Feb 28 2016 03:04:07
%S A025313 325,425,650,725,845,850,925,1025,1105,1300,1325,1445,1450,1525,1625,
%T A025313 1690,1700,1825,1850,1885,2050,2125,2210,2225,2405,2425,2465,2525,
%U A025313 2600,2650,2665,2725,2825,2873,2890,2900,2925,3050,3125,3145,3250,3380,3400
%N A025313 Numbers that are the sum of 2 distinct nonzero squares in 3 or more ways.
%C A025313 Sequence contains no primes (A000040) and no semiprimes (A001358). - Zak Seidov, Apr 07 2011
%C A025313 Sequences A025294 and A025313 are different. For example 1250 is not in A025313. A025294(9) = 1250 = 35^2 + 5^2 = 31^2 + 17^2 = 25^2 + 25^2 (not distinct squares). - _Vaclav Kotesovec_, Feb 27 2016
%C A025313 Numbers in A025294 but not in A025313 are exactly those numbers of the form 2*p_1^(2*a_1)*p_2^(2*a_2)*...*p_m^(2*a_m)*q^4 where p_i are primes of the form 4k+3 and q is a prime of the form 4k+1. Thus 2*5^4 = 1250 is the smallest term in A025294 that is not in A025313. - _Chai Wah Wu_, Feb 27 2016
%H A025313 Zak Seidov, <a href="/A025313/b025313.txt">Table of n, a(n) for n = 1..5386</a>
%H A025313 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A025313 325 = 1^2+18^2 = 6^2+17^2 = 10^2+15^2. [Zak Seidov, Apr 07 2011]
%t A025313 nn = 3400; 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, _?(# >= 3 &)]] (* _T. D. Noe_, Apr 07 2011 *)
%K A025313 nonn
%O A025313 1,1
%A A025313 _David W. Wilson_