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,11

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

Links

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

Formula

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

Prog

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

Crossrefs

Cf. A101337.

Sequence in context: A194633 A243088 A113699 * A366855 A330127 A292568

Adjacent sequences: A113007 A113008 A113009 * A113011 A113012 A113013

Keyword

base,easy,nonn

Author

Alexandre Wajnberg, Jan 03 2006

Status

approved