A073237 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A073237

a(n) = ceiling(Pi^Pi^...^Pi), where Pi appears n times.

1, 4, 37, 1340164183006357436

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

Decimal expansions (before taking ceiling) of Pi (A000796), Pi^Pi (A073233) and Pi^Pi^Pi (A073234) correspond to a(1), a(2) and a(3), respectively. See A073236 for same sequence rounded to nearest integer. This sequence is similar to A004002, which deals with e (but rounds).

a(4) has 666262452970848504 digits. - Martin Renner, Aug 19 2023

LINKS

Table of n, a(n) for n=0..3.

FORMULA

a(n) = ceiling(Pi^Pi^...^Pi), where Pi occurs n times, a(0) = 1 (=Pi^0).

MAPLE

p:= n-> `if`(n=0, 1, Pi^p(n-1)):

a:= n-> ceil(p(n)):

seq(a(n), n=0..3); # Alois P. Heinz, Jul 20 2024

PROG

(PARI) p=0; for(n=0, 3, p=Pi^p; print1(ceil(p), ", ")) \\ n=4 produces too large an exponent for PARI.

CROSSREFS

Cf. A000796 (Pi), A073233 (Pi^Pi), A073234 (Pi^Pi^Pi), A073236 (Pi^Pi^...^Pi, n times, rounded), A004002 (Benford numbers), A056072 (similar to A004002 but takes floor).

Sequence in context: A280219 A027461 A144991 * A218334 A121672 A020205

Adjacent sequences: A073234 A073235 A073236 * A073238 A073239 A073240

KEYWORD

nonn

AUTHOR

Rick L. Shepherd, Jul 25 2002

STATUS

approved