|
|
A295484
|
|
Numbers that have exactly one representation as a sum of six nonnegative squares.
|
|
0
|
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This sequence is finite and complete. See the von Eitzen Link and the proof in A294675 stating that for n > 5408, the number of ways to write n as a sum of 5 squares (without allowing zero squares) is at least floor(sqrt(n - 101) / 8) = 9. Since this sequence relaxes the restriction of zero squares and allows one more square, the number of representations for n > 5408 is at least nine. Then an inspection of n <= 5408 completes the proof.
|
|
REFERENCES
|
E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|