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

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, 256, 512, 1024, 2048, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192

Offset: 0

Author

Alexandre Wajnberg, Jan 03 2006

Keywords

• base
• easy
• nonn

Comments

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

There are no other fixed points less than 10^1000. - Chai Wah Wu, Feb 28 2019

Crossrefs

Cf. A101337.

Programs

Python

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

Formula

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