A230864 log2*(n) (version 3): number of iterations log_2(log_2(log_2(...(n)...))) required for the result to be <= 1.

0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4

Offset: 1

Author

N. J. A. Sloane, Nov 03 2013

Keywords

• nonn

Comments

This is the definition of log2* as given by Wikipedia on Nov 03 2013.

If a(n) = k, then n = 2^2^2^...^2^x, where x is in the range 0 < x <= 1 and there are k 2's in the tower. For example a(5)=3 and 5 = 2^2^2^.28134014520...

Links

• Wikipedia, Iterated Logarithm

Crossrefs

Cf. A010096 (version 1), A001069 (version 2).

Formula

a(1)=0; thereafter a(n) = A010096(n-1).