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 A004807 #21 Aug 04 2020 14:57:45
%S A004807 7,1030,2053,3076,4099,5122,6145,7168,59055,60078,61101,62124,63147,
%T A004807 64170,65193,118103,119126,120149,121172,122195,123218,177151,178174,
%U A004807 179197,180220,181243,236199,237222,238245,239268,295247,296270,297293,354295,355318,413343,1048582
%N A004807 Numbers that are the sum of 7 positive 10th powers.
%H A004807 David A. Corneth, <a href="/A004807/b004807.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%e A004807 From _David A. Corneth_, Aug 03 2020: (Start)
%e A004807 1129904068 is in the sequence as 1129904068 = 2^10 + 2^10 + 2^10 + 7^10 + 7^10 + 7^10 + 7^10.
%e A004807 1357385795 is in the sequence as 1357385795 = 2^10 + 2^10 + 3^10 + 3^10 + 4^10 + 7^10 + 8^10.
%e A004807 3831882028 is in the sequence as 3831882028 = 1^10 + 3^10 + 4^10 + 4^10 + 6^10 + 7^10 + 9^10. (End)
%t A004807 k = 7; 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 A004807 Cf. A008454 (tenth powers).
%K A004807 nonn,easy
%O A004807 1,1
%A A004807 _N. J. A. Sloane_