Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095811
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095811 Greatest number, not divisible by 4, having exactly n partitions into three squares. +0
2
427, 1555, 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; listen)
OFFSET

1,1

COMMENT

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

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, 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}]

CROSSREFS

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

Sequence in context: A048922 A045094 A054984 this_sequence A030467 A034278 A116870

Adjacent sequences: A095808 A095809 A095810 this_sequence A095812 A095813 A095814

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research