This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A295750 #8 Dec 03 2017 02:13:50 %S A295750 34,39 %N A295750 Numbers that have exactly nine representations of a sum of seven nonnegative squares. %C A295750 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 two more zero squares, the number of representations for n > 5408 is at least nine. Then an inspection of n <= 5408 completes the proof. %D A295750 E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1. %H A295750 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 A295750 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. %Y A295750 Cf. A025422, A295492. %K A295750 nonn,fini,full %O A295750 1,1 %A A295750 _Robert Price_, Nov 26 2017