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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A295701 Smallest number with exactly n representations as a sum of six positive squares. 0
0, 2006, 30611 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

It appears that this sequence is finite and complete.

REFERENCES

E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.

LINKS

Table of n, a(n) for n=0..2.

D. H. Lehmer, On the Partition of Numbers into Squares, The American Mathematical Monthly, Vol. 55, No. 8, October 1948, pp. 476-481.

CROSSREFS

Cf. A000177, A025430.

Sequence in context: A203043 A189353 A162244 * A250922 A201343 A219083

Adjacent sequences: A295698 A295699 A295700 * A295702 A295703 A295704

KEYWORD

nonn

AUTHOR

Robert Price, Nov 25 2017

STATUS

approved

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 December 8 22:05 EST 2022. Contains 358698 sequences. (Running on oeis4.)