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 A295494 #19 Nov 26 2017 19:15:48
%S A295494 0,4,9,17,20,30,29,38,36,45,52,53,54,65,74,68,83,77,90,84,86,99,100,
%T A295494 107,101,108,110,117,129,116,131,125,126,146,152,140,134,192,156,149,
%U A295494 161
%N A295494 Smallest number with exactly n representations as a sum of six nonnegative squares.
%C A295494 It appears that a(n) does not exist for n in {42, 55, 61, 74, 99, 100, 103, 125, 135, 139, 148, 152, 161, 162, 164, 168, 180, 182, 194, 196}; i.e., there is no integer whose number of representations is any of these values.
%D A295494 E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
%H A295494 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.
%t A295494 Table[SelectFirst[Range@ 200, Length@ PowersRepresentations[#, 6, 2] == n &] - Boole[n == 1], {n, 41}] (* _Michael De Vlieger_, Nov 26 2017 *)
%Y A295494 Cf. A000177, A295159.
%K A295494 nonn
%O A295494 0,2
%A A295494 _Robert Price_, Nov 22 2017