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!)
A074496 a(n) = smallest prime > e^n. 8

%I #33 Feb 20 2024 07:00:52

%S 2,3,11,23,59,149,409,1097,2999,8111,22027,59879,162779,442439,

%T 1202609,3269029,8886113,24154957,65660003,178482319,485165237,

%U 1318815761,3584912873,9744803489,26489122147,72004899361,195729609461,532048240609,1446257064299,3931334297161

%N a(n) = smallest prime > e^n.

%H Amiram Eldar, <a href="/A074496/b074496.txt">Table of n, a(n) for n = 0..2302</a>

%F Limmit_{n -> infinity} a(n+1)/a(n) = e. - _Jonathan Vos Post_, Apr 30 2006

%e The first prime > e^3 = 20.085... is 23, so a(3) = 23.

%t a[n_] := NextPrime[Exp[n]]; a /@ Range[0, 20] (* _Giovanni Resta_, Apr 03 2017 *)

%o (PARI) for(n=1,50,print1(nextprime(exp(n))","))

%Y Cf. A000040, A000149, A001113, A014210, A014211, A074497.

%K nonn

%O 0,1

%A _Joseph L. Pe_, Sep 26 2002

%E More terms from _Ralf Stephan_, Mar 25 2003

%E Edited by _N. J. A. Sloane_, Dec 22 2006

%E a(18) inserted and more terms added by _Amiram Eldar_, Sep 30 2019

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 10:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)