cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A171990 Least integer a(n) for which the iterated function log, iterated n times, is defined.

Original entry on oeis.org

1, 2, 3, 16, 3814280
Offset: 1

Views

Author

Keywords

Comments

Log(a(1)) is defined if a(1) > 0, so a(1) = 1.
Log(log(a(2))) is defined if log(a(2)) > 0 => a(2) > 1 => a(2) = 2.
The sequence grows rapidly: a(6) = 2.33150...10^1656520, and is too large to include here.

Examples

			a(2) = 2 because log(log(2)) is defined and log(log(1)) is not;
a(3) = 3 because log(log(log(3))) is defined;
a(4) = 16 because log(log(log(log(16)))) is defined.
From _Robert G. Wilson v_, Jul 05 2022: (Start)
a(3) = ceiling(A001113).
a(4) = ceiling(A073226).
a(5) = ceiling(A073227).
a(6) = ceiling(A085667). (End)
		

Crossrefs

Programs

  • PARI
    a(n) = my(k=1); while(1, my(s=k, i=0); while(s > 0, s=log(s); if(s > 0, i++)); if(i==n-1, return(k)); k++) \\ Felix Fröhlich, Nov 22 2015

Formula

For n > 2, a(n) = ceiling(e^(e^(...))) where e appears n-2 times.