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!)
A093865 a(1) = 2, a(n) = least prime > a(n-1)^n. 0

%I #10 Aug 16 2019 15:19:52

%S 2,5,127,260144663,1191446656198440121121655815832664828439647

%N a(1) = 2, a(n) = least prime > a(n-1)^n.

%C a(6) has 253 digits and is too large to include. - _Emeric Deutsch_, Feb 04 2006

%e a(3)=127 because a(2)^3=125 and the least prime greater than 125 is 127.

%p a:= proc(n) option remember; if n=1 then 2 else nextprime(a(n-1)^n) fi end: seq(a(n), n=1..6); # _Emeric Deutsch_, Feb 04 2006

%t nxt[{n_,a_}]:={n+1,NextPrime[a^(n+1)]}; NestList[nxt,{1,2},5][[All,2]] (* _Harvey P. Dale_, Nov 15 2018 *)

%K nonn

%O 1,1

%A _Amarnath Murthy_, Apr 20 2004

%E More terms from _Emeric Deutsch_, Feb 04 2006

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 25 13:34 EDT 2024. Contains 371971 sequences. (Running on oeis4.)