A211666 Number of iterations log_10(log_10(log_10(...(n)...))) such that the result is < 2.

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2

Offset: 1

Author

Hieronymus Fischer, Apr 30 2012

Keywords

• base
• nonn

Comments

Different from A004216, A057427 and A185114.

For a general definition like "Number of iterations log_p(log_p(log_p(...(n)...))) such that the result is < q", where p > 1, q > 0, the resulting g.f. is

g(x) = (1/(1-x))*Sum_{k>=1} x^(E_{i=1..k} b(i,k)), where b(i,k)=p for i

Examples

			a(n) = 0, 1, 2, 3 for n = 1, 2, 10^2, 10^10^2 (= 1, 2, 100, 10^100).
		

Crossrefs

Cf. A001069, A010096, A211662, A211664, A211668, A211670.

Formula

With the exponentiation definition E_{i=1..n} c(i) := c(1)^(c(2)^(c(3)^(...(c(n-1)^(c(n)))...))); E_{i=1..0} c := 1; example: E_{i=1..3} 10 = 10^(10^10) = 10^10000000000, we get:

a(E_{i=1..n} 10) = a(E_{i=1..n-1} 10)+1, for n>=1.

G.f.: g(x) = (1/(1-x))*Sum_{k>=1} x^(E_{i=1..k} b(i,k)), where b(i,k)=10 for i

The explicit first terms of the g.f. are g(x) = (x^2+x^100+x^(10^100)+...)/(1-x).

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.