|
%I #13 Jan 04 2016 01:54:11
%S 206,230,266,269,326,350,381,389,398,413,414,425,437,441,470,474,486,
%T 525,554,585,590,593,611,630,635,638,659,662,674,706,729,731,758,781,
%U 819,824,829,830,851,874,878,890,901,905,917,920,923,978,985,1006,1011,1021,1035
%N Numbers that are the sum of 3 distinct nonzero squares in exactly 5 ways.
%H Robert Israel, <a href="/A025343/b025343.txt">Table of n, a(n) for n = 1..2380</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%p N:= 10^6;
%p A:= Vector(N):
%p for a from 1 to floor(sqrt(N/3)) do
%p for b from a+1 to floor(sqrt((N-a^2)/2)) do
%p c:= [$(b+1) .. floor(sqrt(N-a^2-b^2))]:
%p v:= map(t -> a^2 + b^2 + t^2, c):
%p A[v]:= map(`+`,A[v],1)
%p od od:
%p select(t -> A[t]=5,[$1..N]); # _Robert Israel_, Jan 03 2016
%K nonn
%O 1,1
%A _David W. Wilson_
|
