|
Search: id:A067652
|
|
|
| A067652 |
|
2 plus 3, twice 3, 2 to the power of 3, etc. |
|
+0
1
|
| |
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(5) is very large, the number of digits of the number of digits of the number of digits etc. iterated thousands of times is still large.
|
|
FORMULA
|
f(3, n) where f(a, 0) = 2+a, f(0, 1) = 0, f(0, n) = 1 for n > 1, f(a, n) = f(f(a-1, n), n-1) for a>0 and n > 0
|
|
PROGRAM
|
(Haskell) f a 0 = 2 + a / f 0 1 = 0 / f 0 n = 1 / f a n = f (f (a-1) n) (n-1)
|
|
CROSSREFS
|
Sequence in context: A105057 A058336 A110461 this_sequence A129318 A054378 A129319
Adjacent sequences: A067649 A067650 A067651 this_sequence A067653 A067654 A067655
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ashley Yakeley (ashley(AT)yakeley.org), Feb 03 2002
|
|
|
Search completed in 0.002 seconds
|
