|
|
A211663
|
|
Number of iterations log(log(log(...(n)...))) such that the result is < 1.
|
|
2
|
|
|
1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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} := 1; example: E_{i=1..4} 3 = 3^(3^(3^3)) = 3^(3^27), we get:
a(ceiling(E_{i=1..n} e)) = a(ceiling(E_{i=1..n-1} e))+1, for n>=1.
G.f.: g(x) = (1/(1-x))*Sum_{k>=0} x^(ceiling(E_{i=1..k} e)). The explicit first terms of the g.f. are g(x) = (x + x^3 + x^16 + x^3814280 + ...)/(1-x).
|
|
EXAMPLE
|
a(n)=1, 2, 3, 4, for n=1, ceiling(e), ceiling(e^e), ceiling(e^e^e), = 1, 3, 16, 3814280, respectively.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|