The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #15 Dec 08 2013 06:30:03
%S 8125,10625,16250,18125,21250,23125,25625,32500,33125,36250,38125,
%T 42500,45625,46250,51250,55625,60625,63125,65000,66250,68125,70625,
%U 72500,73125,76250,85000,85625,91250,92500,93125,95625,98125,102500,108125,111250
%N Numbers that are the sum of 2 distinct nonzero squares in exactly 5 ways.
%H Donovan Johnson, <a href="/A025306/b025306.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 = 111250; 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, 5]] (* _T. D. Noe_, Apr 07 2011 *)
%K nonn
%O 1,1
%A _David W. Wilson_