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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073237 a(n) = ceiling(Pi^Pi^...^Pi), where Pi appears n times. 2

%I #13 Aug 22 2023 11:57:36

%S 1,4,37,1340164183006357436

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

%C 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).

%C a(4) has 666262452970848504 digits. - _Martin Renner_, Aug 19 2023

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

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

%Y 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).

%K nonn

%O 0,2

%A _Rick L. Shepherd_, Jul 25 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)