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 A295157 #15 Dec 03 2017 00:40:56 %S A295157 61,67,68,70,75,76,84,88,89,92,120 %N A295157 Numbers that have exactly nine representations as a sum of five nonnegative squares. %C A295157 This sequence is finite and complete. See the von Eitzen Link. For positive integer n, if n > 6501 then the number of ways to write n as a sum of 5 squares is at least 10. So for n > 6501, there are more than eight ways to write n as a sum of 5 squares. For n <= 6501, it has been verified if n is in the sequence by inspection. Hence the sequence is complete. %D A295157 E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1. %H A295157 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 A295157 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 A295157 Cf. A000174, A006431, A294675. %K A295157 nonn,fini,full %O A295157 1,1 %A A295157 _Robert Price_, Nov 15 2017