OFFSET

1,1

COMMENTS

This sequence is finite and complete. See the von Eitzen Link. For positive integer n, if n > 6501 then the number of ways to write n as a sum of 5 squares is at least 10. So for n > 6501, there are more than eight ways to write n as a sum of 5 squares. For n <= 6501, it has been verified if n is in the sequence by inspection. Hence the sequence is complete.

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

KEYWORD

nonn,fini,full

AUTHOR

Robert Price, Nov 15 2017

STATUS

approved