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 A004809 #23 Aug 04 2020 15:26:45
%S A004809 9,1032,2055,3078,4101,5124,6147,7170,8193,9216,59057,60080,61103,
%T A004809 62126,63149,64172,65195,66218,67241,118105,119128,120151,121174,
%U A004809 122197,123220,124243,125266,177153,178176,179199,180222,181245,182268,183291,236201,237224,238247,239270
%N A004809 Numbers that are the sum of 9 positive 10th powers.
%H A004809 David A. Corneth, <a href="/A004809/b004809.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%e A004809 From _David A. Corneth_, Aug 03 2020: (Start)
%e A004809 251633402 is in the sequence as 251633402 = 1^10 + 2^10 + 2^10 + 2^10 + 5^10 + 6^10 + 6^10 + 6^10 + 6^10.
%e A004809 383052503 is in the sequence as 383052503 = 1^10 + 1^10 + 4^10 + 5^10 + 5^10 + 5^10 + 5^10 + 6^10 + 7^10.
%e A004809 626642399 is in the sequence as 626642399 = 1^10 + 1^10 + 3^10 + 3^10 + 3^10 + 4^10 + 6^10 + 7^10 + 7^10. (End)
%t A004809 k = 9; 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 A004809 Cf. A008454 (tenth powers).
%K A004809 nonn,easy
%O A004809 1,1
%A A004809 _N. J. A. Sloane_