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

 Hints (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
 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 (list; graph; refs; listen; history; text; internal format)
 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 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 * A330127 A292568 A056767 Adjacent sequences:  A113007 A113008 A113009 * A113011 A113012 A113013 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.

Last modified September 28 19:16 EDT 2021. Contains 347717 sequences. (Running on oeis4.)