

A295150


Numbers that have exactly two representations as a sum of five nonnegative squares.


10




OFFSET

1,1


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, 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. SpringerVerlag, New York, 1985, p. 86, Theorem 1.


LINKS

Table of n, a(n) for n=1..10.
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. 476481.


MATHEMATICA

okQ[n_] := Length[PowersRepresentations[n, 5, 2]] == 2;
Select[Range[100], okQ] (* JeanFrançois Alcover, Feb 26 2019 *)


CROSSREFS

Cf. A000174, A006431, A294675.
Sequence in context: A104883 A154885 A292192 * A042956 A128217 A288671
Adjacent sequences: A295147 A295148 A295149 * A295151 A295152 A295153


KEYWORD

nonn,fini,full


AUTHOR

Robert Price, Nov 15 2017


STATUS

approved



