login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Here 0^0 is taken to be 1. - Alonso del Arte, Sep 21 2019
LINKS
FORMULA
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) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=0, 400, write("b067040.txt", n, " ", n^SumD(n)) ) } \\ Harry J. Smith, Apr 29 2010
CROSSREFS
Cf. A007953.
Sequence in context: A045503 A134010 A117280 * A070271 A324809 A245414
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, Dec 29 2001
EXTENSIONS
More terms from Jason Earls, Jan 18 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)