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!)
A295493 Numbers that have exactly ten representations as a sum of six nonnegative squares. 1
45, 50, 56, 58 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
This sequence is finite and complete. See the von Eitzen Link and the proof in A294675 stating that for n > 7845, the number of ways to write n as a sum of 5 squares (without allowing zero squares) is at least 11. Since this sequence relaxes the restriction of zero squares and allows one more square, the number of representations for n > 7845 is at least 11. Then an inspection of n <= 7845 completes the proof.
REFERENCES
E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
LINKS
H. von Eitzen, in reply to user James47, What is the largest integer with only one representation as a sum of five nonzero squares? on stackexchange.com, May 2014
D. H. Lehmer, On the Partition of Numbers into Squares, The American Mathematical Monthly, Vol. 55, No. 8, October 1948, pp. 476-481.
CROSSREFS
Sequence in context: A045566 A274368 A214572 * A184043 A345482 A295802
KEYWORD
nonn,fini,full
AUTHOR
Robert Price, Nov 22 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 March 29 08:45 EDT 2024. Contains 371267 sequences. (Running on oeis4.)