The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #15 Dec 08 2013 06:29:54
%S 27625,32045,40885,45305,47125,55250,58565,60125,61625,64090,66625,
%T 67405,69745,77285,78625,80665,81770,86125,87125,90610,91205,94250,
%U 98345,98605,99125,99905,101065,107185,110500,111605,112625,114985,117130,118625
%N Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.
%H Donovan Johnson, <a href="/A025309/b025309.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%t 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 nonn
%O 1,1
%A _David W. Wilson_