%I #27 Nov 06 2020 10:38:19
%S 20,38,41,45,47,48,49,50,54,55,63,66,81,105
%N Numbers that are the sum of 5 nonzero squares in exactly 2 ways.
%C Inspected values of n <= 50000.
%C This sequence is complete, see the von Eitzen Link and Price's computation that the next term must be > 50000. Proof. The link mentions "for positive integer n, if n > 5408 then the number of ways to write n as a sum of 5 squares is at least Floor(Sqrt(n - 101) / 8)". So for n > 5408, there are more than two ways to write n as a sum of 5 squares. For n <= 5408, it has been verified if n is in the sequence by inspection. Hence the sequence is complete." - _David A. Corneth_, Nov 08 2017
%D E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
%H H. von Eitzen, in reply to user James47, <a href="http://math.stackexchange.com/questions/811824/what-is-the-largest-integer-with-only-one-representation-as-a-sum-of-five-nonzer">What is the largest integer with only one representation as a sum of five nonzero squares?</a> on stackexchange.com, May 2014
%H D. H. Lehmer, <a href="http://www.jstor.org/stable/2305380">On the Partition of Numbers into Squares</a>, The American Mathematical Monthly, Vol. 55, No. 8, October 1948, pp. 476-481.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SquareNumber.html">Square Number</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A243148(a(n),5) = 2. - _Alois P. Heinz_, Feb 26 2019
%e There are exactly two ways 20 is a sum of 5 nonzero squares. These are 1^2 + 1^2 + 1^2 + 1^2 + 4^2 = 2^2 + 2^2 + 2^2 + 2^2 + 2^2 = 20. Therefore 20 is in the sequence.
%t Select[Range[200], Length[Select[PowersRepresentations[#, 5, 2], #[[1]] > 0&]] == 2&] (* _Jean-François Alcover_, Nov 06 2020 *)
%Y Cf. A025429, A025357, A243148, A294675.
%K nonn,fini,full
%O 1,1
%A _Robert Price_, Nov 07 2017
|