login

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”).

A067040
a(n) = n^(sum of digits of n).
2
1, 1, 4, 27, 256, 3125, 46656, 823543, 16777216, 387420489, 10, 121, 1728, 28561, 537824, 11390625, 268435456, 6975757441, 198359290368, 6131066257801, 400, 9261, 234256, 6436343, 191102976, 6103515625, 208827064576, 7625597484987
OFFSET
0,3
COMMENTS
Here 0^0 is taken to be 1. - Alonso del Arte, Sep 21 2019
LINKS
FORMULA
a(n) = n^A007953(n).
a(n) = n only when n is a power of 10. - Alonso del Arte, Sep 21 2019
EXAMPLE
a(12) = 12^(1 + 2) = 12^3 = 1728.
a(13) = 13^(1 + 3) = 13^4 = 28561.
MAPLE
a:= n-> n^add(i, i=convert(n, base, 10)):
seq(a(n), n=0..30); # Alois P. Heinz, Sep 21 2019
MATHEMATICA
Table[n^(Plus@@IntegerDigits[n]), {n, 0, 99}] (* Alonso del Arte, Sep 14 2019 *)
PROG
(PARI) a(n) = {n^sumdigits(n)} \\ Harry J. Smith, Apr 29 2010
CROSSREFS
Cf. A007953.
Sequence in context: A045503 A134010 A117280 * A070271 A324809 A245414
KEYWORD
nonn,base,easy,changed
AUTHOR
Amarnath Murthy, Dec 29 2001
EXTENSIONS
More terms from Jason Earls, Jan 18 2002
STATUS
approved