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!)
A095811 Greatest number, not divisible by 4, having exactly n partitions into three squares. 1

%I #3 Mar 30 2012 17:22:33

%S 427,1555,3763,6307,13843,16003,21547,34483,48427,54763,85507,90787,

%T 111763,103387,166147,137083,222643,211843,289963,253507,296587,

%U 319867,462883,375523,393187,546067,502483,532123,615883,590947

%N Greatest number, not divisible by 4, having exactly n partitions into three squares.

%C These are conjectured values. The Mathematica program checks numbers up to 10^6. Note that a square can be zero.

%t lim=1000; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n<lim^2, nLst[[n]]++ ], {a, 0, lim}, {b, a, Sqrt[lim^2-a^2]}, {c, b, Sqrt[lim^2-a^2-b^2]}]; Table[Last[Select[Flatten[Position[nLst, k]], Mod[ #, 4]>0&]], {k, 30}]

%Y Cf. A095809 (least number having exactly n partitions into three squares).

%K nonn

%O 1,1

%A _T. D. Noe_, Jun 07 2004

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 April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)