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 A068477 #10 Oct 16 2018 03:39:51
%S A068477 0,1,5,9,12,15,22,10,33,45,43,60,44,79,70,72,65,90,111,91,125,117,132,
%T A068477 168,133,127,171,189,172,195,218,232,217,234,221,243,240,280,290,261,
%U A068477 315,348,352,325,345,351,346,303,338,367,373,396,404,414,495,424,428
%N A068477 a(n) is the digital sum of 1^n + 2^n + ... + n^n.
%H A068477 G. C. Greubel, <a href="/A068477/b068477.txt">Table of n, a(n) for n = 0..1000</a>
%F A068477 a(n) = A007953(A031971(n))
%p A068477 dig := X->convert((convert(X,base,10)),`+`); a := n->dig(sum(m^n,m=1..n));
%t A068477 Table[Sum[DigitCount[Sum[k^n, {k, 1, n}]][[i]]*i, {i, 9}], {n, 0, 100}] (* _G. C. Greubel_, Oct 13 2018 *)
%o A068477 (PARI) a(n) = sumdigits(sum(k=1, n, k^n)); \\ _Michel Marcus_, Oct 14 2018
%K A068477 nonn,base
%O A068477 0,3
%A A068477 Francois Jooste (phukraut(AT)hotmail.com), Mar 10 2002