Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113010 {Number of digits of n} raised to the power of {the sum of the digits of n}. +0
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; listen)
OFFSET

0,11

COMMENT

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

FORMULA

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

CROSSREFS

Cf. A101337.

Sequence in context: A008862 A145116 A122265 this_sequence A056767 A008863 A145117

Adjacent sequences: A113007 A113008 A113009 this_sequence A113011 A113012 A113013

KEYWORD

base,easy,nonn

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 03 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research