0,1
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.
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
(Haskell) f a 0 = 2 + a / f 0 1 = 0 / f 0 n = 1 / f a n = f (f (a-1) n) (n-1)
Sequence in context: A105057 A058336 A110461 * A191212 A129318 A054378
Adjacent sequences: A067649 A067650 A067651 * A067653 A067654 A067655
nonn
Ashley Yakeley (ashley(AT)yakeley.org), Feb 03 2002
