login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095812 Greatest number, not divisible by 4, having exactly n partitions into three positive squares. 1
793, 1885, 3763, 6307, 13843, 16003, 21547, 34483, 48427, 54763, 85507, 90787, 111763, 103387, 166147, 137083, 222643, 211843, 289963, 253507, 296587, 319867, 462883, 375523, 393187, 546067, 502483, 532123, 615883, 590947 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

These are conjectured values. The Mathematica program checks numbers up to 10^6.

MATHEMATICA

lim=1000; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n<lim^2, nLst[[n]]++ ], {a, 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}]

CROSSREFS

Cf. A025414 (least sum of 3 nonzero squares in exactly n ways).

Sequence in context: A140909 A037146 A045246 * A130555 A133537 A075667

Adjacent sequences:  A095809 A095810 A095811 * A095813 A095814 A095815

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jun 07 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.