login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113009 {Sum of the digits of n} raised to the power {number of digits of n}. 1
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 36, 49, 64, 81, 100, 121, 144, 169, 196 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Fixed points are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 81, 5832. Are there any others?

Fixed points include: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 81, 512, 2401. There are no other fixed points less than 10^1000. - Chai Wah Wu, Feb 28 2019

LINKS

Table of n, a(n) for n=0..68.

FORMULA

a(ijk...)[m digits ijk...]=(i+j+k)^m

EXAMPLE

a(9)=9^1=9

a(19)=(1+9)^2=100

a(101)=(1+0+1)^3=8

MATHEMATICA

Join[{0}, Table[Total[IntegerDigits[n]]^IntegerLength[n], {n, 100}]] (* Harvey P. Dale, Nov 09 2014 *)

PROG

(Python)

def A113009(n):

    return sum(int(d) for d in str(n))**len(str(n)) # Chai Wah Wu, Feb 28 2019

CROSSREFS

Cf. A101337.

Sequence in context: A325454 A112875 A113018 * A068064 A152147 A333830

Adjacent sequences:  A113006 A113007 A113008 * A113010 A113011 A113012

KEYWORD

base,easy,nonn

AUTHOR

Alexandre Wajnberg, Jan 03 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 02:21 EDT 2021. Contains 348099 sequences. (Running on oeis4.)