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 A295919 #6 Nov 29 2017 23:09:19
%S A295919 0,4,8,13,16,20,22,25,30,29,34
%N A295919 Smallest number with exactly n representations as a sum of eight nonnegative squares.
%C A295919 It appears that a(n) does not exist for n in {12, 24, 39, 40, 48, 50, 53, 58, 60, 64, 67, 70, 71, 75, 78, 81, 83, 85, 86, 87, 91, 92, 96, 102, 103, 108, 113, 115, 120, 122, 123, 124, 128, 129, 130, 132, 135, 136, 138, 140, 142, 143, 144, 145, 148, 150, 151, 155, 156, 158, 160, 161, 164, 168, 170, 171, 172, 174, 175, 177, 178, 181, 183, 185, 186, 188, 189, 190, 196, 197, 198, 199, 200}; i.e., there is no integer whose number of representations is any of these values.
%D A295919 E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
%H A295919 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 A295919 Cf. A025423, A295752.
%K A295919 nonn,more
%O A295919 0,2
%A A295919 _Robert Price_, Nov 29 2017