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 A067040 #24 Dec 05 2024 18:04:19
%S A067040 1,1,4,27,256,3125,46656,823543,16777216,387420489,10,121,1728,28561,
%T A067040 537824,11390625,268435456,6975757441,198359290368,6131066257801,400,
%U A067040 9261,234256,6436343,191102976,6103515625,208827064576,7625597484987
%N A067040 a(n) = n^(sum of digits of n).
%C A067040 Here 0^0 is taken to be 1. - _Alonso del Arte_, Sep 21 2019
%H A067040 Harry J. Smith, <a href="/A067040/b067040.txt">Table of n, a(n) for n = 0..400</a>
%F A067040 a(n) = n^A007953(n).
%F A067040 a(n) = n only when n is a power of 10. - _Alonso del Arte_, Sep 21 2019
%e A067040 a(12) = 12^(1 + 2) = 12^3 = 1728.
%e A067040 a(13) = 13^(1 + 3) = 13^4 = 28561.
%p A067040 a:= n-> n^add(i,i=convert(n, base, 10)):
%p A067040 seq(a(n), n=0..30); # _Alois P. Heinz_, Sep 21 2019
%t A067040 Table[n^(Plus@@IntegerDigits[n]), {n, 0, 99}] (* _Alonso del Arte_, Sep 14 2019 *)
%o A067040 (PARI) a(n) = {n^sumdigits(n)} \\ _Harry J. Smith_, Apr 29 2010
%Y A067040 Cf. A007953.
%K A067040 nonn,base,easy
%O A067040 0,3
%A A067040 _Amarnath Murthy_, Dec 29 2001
%E A067040 More terms from _Jason Earls_, Jan 18 2002