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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113010 {Number of digits of n} raised to the power of {the sum of the digits of n}. 1


%S 1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1024,4,8,16,32,64,128,

%T 256,512,1024,2048,8,16,32,64,128,256,512,1024,2048,4096,16,32,64,128,

%U 256,512,1024,2048,4096,8192,32,64,128,256,512,1024,2048,4096,8192

%N {Number of digits of n} raised to the power of {the sum of the digits of n}.

%C n=1 and 32 are two fixed points. Are there any others?

%C There are no other fixed points less than 10^1000. - _Chai Wah Wu_, Feb 28 2019

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

%o (Python)

%o def A113010(n):

%o return len(str(n))**sum(int(d) for d in str(n)) # _Chai Wah Wu_, Feb 28 2019

%Y Cf. A101337.

%K base,easy,nonn

%O 0,11

%A _Alexandre Wajnberg_, Jan 03 2006

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 21 01:48 EDT 2021. Contains 348137 sequences. (Running on oeis4.)