Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Dec 05 2024 18:04:19
%S 1,1,4,27,256,3125,46656,823543,16777216,387420489,10,121,1728,28561,
%T 537824,11390625,268435456,6975757441,198359290368,6131066257801,400,
%U 9261,234256,6436343,191102976,6103515625,208827064576,7625597484987
%N a(n) = n^(sum of digits of n).
%C Here 0^0 is taken to be 1. - _Alonso del Arte_, Sep 21 2019
%H Harry J. Smith, <a href="/A067040/b067040.txt">Table of n, a(n) for n = 0..400</a>
%F a(n) = n^A007953(n).
%F a(n) = n only when n is a power of 10. - _Alonso del Arte_, Sep 21 2019
%e a(12) = 12^(1 + 2) = 12^3 = 1728.
%e a(13) = 13^(1 + 3) = 13^4 = 28561.
%p a:= n-> n^add(i,i=convert(n, base, 10)):
%p seq(a(n), n=0..30); # _Alois P. Heinz_, Sep 21 2019
%t Table[n^(Plus@@IntegerDigits[n]), {n, 0, 99}] (* _Alonso del Arte_, Sep 14 2019 *)
%o (PARI) a(n) = {n^sumdigits(n)} \\ _Harry J. Smith_, Apr 29 2010
%Y Cf. A007953.
%K nonn,base,easy,changed
%O 0,3
%A _Amarnath Murthy_, Dec 29 2001
%E More terms from _Jason Earls_, Jan 18 2002