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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063458 a(n) = floor(a(n-1)^(Pi-1)); a(1) = 2. 2

%I #13 Jun 26 2018 05:01:13

%S 2,4,19,547,730556,3610416325914,781938194552128470561538915,

%T 3928443413414047007552974915529711833274293773223249470297,

%U 2204750835730403575885277542208188462124094746081014153047016607543500543796047647406417833643102917913427416915474468453030

%N a(n) = floor(a(n-1)^(Pi-1)); a(1) = 2.

%H Harry J. Smith, <a href="/A063458/b063458.txt">Table of n, a(n) for n = 1..11</a>

%t a[1] = 2; a[n_] = Floor[ a[n - 1]^(Pi - 1) ]; Table[ a[n], {n, 1, 9} ]

%t With[{c=Pi-1},NestList[Floor[#^c]&,2,10]] (* _Harvey P. Dale_, Oct 03 2012 *)

%o (PARI) { default(realprecision, 2000); for (n=1, 11, if (n>1, a=floor(a^(Pi - 1)), a=2); write("b063458.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 22 2009

%Y Cf. A063457.

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Jul 25 2001

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.

Last modified June 9 23:28 EDT 2023. Contains 363183 sequences. (Running on oeis4.)