login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025344 Numbers that are the sum of 3 distinct nonzero squares in exactly 6 ways. 1

%I #13 Jan 04 2016 01:54:01

%S 314,329,374,426,434,458,497,530,542,546,558,594,602,605,641,650,665,

%T 693,698,705,713,714,725,741,746,750,755,766,773,774,782,818,825,833,

%U 842,845,849,861,875,882,885,902,930,934,962,966,998,1010,1013,1019,1026,1058

%N Numbers that are the sum of 3 distinct nonzero squares in exactly 6 ways.

%H Robert Israel, <a href="/A025344/b025344.txt">Table of n, a(n) for n = 1..4446</a>

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%p N:= 10^6; # to get all terms <= N

%p S:= 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 S[v]:= map(`+`, S[v], 1)

%p od od: select(t -> S[t]=6, [$1..N]); # _Robert Israel_, Jan 03 2016

%K nonn

%O 1,1

%A _David W. Wilson_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)