Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Dec 03 2017 00:55:01
%S 107,109,116,125,140,146,168,209,249,273,297
%N Numbers that are the sum of 5 nonzero squares in exactly 10 ways.
%C Theorem: There are no further terms. Proof (from a proof by _David A. Corneth_ on Nov 08 2017 in A294736): The von Eitzen link states that if n > 7845 then the number of ways to write n as a sum of 5 squares is at least 11. For n <= 7845 terms have been verified by inspection. Hence this sequence is finite and complete.
%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>
%t fQ[n_] := Block[{pr = PowersRepresentations[n, 5, 2]}, Length@Select[pr, #[[1]] > 0 &] == 10]; Select[ Range@300, fQ](* _Robert G. Wilson v_, Nov 17 2017 *)
%Y Cf. A025429, A025357, A294675, A294736.
%K nonn,fini,full
%O 1,1
%A _Robert Price_, Nov 07 2017