|
Search: id:A113019
|
|
|
| A113019 |
|
{Number of digits of n} raised to the power of the {digital root of n}. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,11
|
|
|
COMMENT
|
n=1 and 32 are fixed points. Are there any others?
First occurrence of k: 1,10,100,11,10000,100000,1000000,12,101,1000000000, ..., . - Robert G. Wilson v.
|
|
FORMULA
|
a(ijk...) [m digits ijk...] = m^(i+j+k+..[one digit])
a(n)=A055642(n)^A010888(n). - Robert G. Wilson v
|
|
EXAMPLE
|
a(0) = 1^0 = 1
a(9) = 1^9 = 1
a(10) = 2^(1+0) = 2
a(89) = 2^(8+9=17=>1+7) = 2^8 = 256
|
|
MATHEMATICA
|
f[n_] := If[n == 0, 1, Floor[ Log[10, 10n]]^(Mod[n - 1, 9] + 1)]; Table[ f[n], {n, 0, 73}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Jan 04 2006)
|
|
CROSSREFS
|
Cf. A101337.
Sequence in context: A145115 A104144 A123464 this_sequence A069877 A085940 A061509
Adjacent sequences: A113016 A113017 A113018 this_sequence A113020 A113021 A113022
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 03 2006
|
|
|
Search completed in 0.002 seconds
|
