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 A004808 #27 Aug 04 2020 17:10:01
%S A004808 8,1031,2054,3077,4100,5123,6146,7169,8192,59056,60079,61102,62125,
%T A004808 63148,64171,65194,66217,118104,119127,120150,121173,122196,123219,
%U A004808 124242,177152,178175,179198,180221,181244,182267,236200,237223,238246,239269,240292,295248,296271,297294
%N A004808 Numbers that are the sum of 8 positive 10th powers.
%H A004808 David A. Corneth, <a href="/A004808/b004808.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%e A004808 1031 = 2^10 + 7 * 1^10 is a term.
%e A004808 From _David A. Corneth_, Aug 04 2020: (Start)
%e A004808 283583902 is in the sequence as 283583902 = 1^10 + 1^10 + 1^10 + 1^10 + 2^10 + 3^10 + 4^10 + 7^10.
%e A004808 493229701 is in the sequence as 493229701 = 3^10 + 5^10 + 5^10 + 5^10 + 6^10 + 6^10 + 6^10 + 7^10.
%e A004808 1256366075 is in the sequence as 1256366075 = 3^10 + 3^10 + 3^10 + 4^10 + 6^10 + 6^10 + 6^10 + 8^10. (End)
%t A004808 k = 8; p = 10; amax = 10^6; bmax = amax^(1/p) // Ceiling; Clear[b]; b[0] = 1; Select[Table[Total[Array[b, k]^p], {b[1], b[0], bmax}, Evaluate[ Sequence @@ Table[{b[j], b[j-1], bmax}, {j, 1, k}]]] //Flatten // Union, # <= amax&] (* _Jean-François Alcover_, Jul 19 2017 *)
%Y A004808 Cf. A008454 (tenth powers).
%K A004808 nonn,easy
%O A004808 1,1
%A A004808 _N. J. A. Sloane_