|
Search: id:A067083
|
|
|
| A067083 |
|
Number of digits in n^{n^(n-1)}. |
|
+0
1
|
|
| 1, 2, 5, 39, 437, 6051, 99425, 1893917, 41077012, 1000000001, 27011044252, 801840699303, 25952747043667, 909698753958571, 34333545124721025, 1388255822130839284, 59875111056395524697, 2743914679527468673294
(list; graph; listen)
|
|
|
OFFSET
|
10,2
|
|
|
FORMULA
|
for n>2 a(n) = floor(n^(n-1)*log(n)/log(10)) + 1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 20 2002
|
|
EXAMPLE
|
a(4) = 39 as 4^(4^3)=4^64 = 3.4028236692093846346337460743177e+38.
|
|
CROSSREFS
|
Sequence in context: A051501 A135378 A077398 this_sequence A109003 A120031 A110066
Adjacent sequences: A067080 A067081 A067082 this_sequence A067084 A067085 A067086
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 05 2002
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 20 2002
|
|
|
Search completed in 0.002 seconds
|
