cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A074496 a(n) = smallest prime > e^n.

Original entry on oeis.org

2, 3, 11, 23, 59, 149, 409, 1097, 2999, 8111, 22027, 59879, 162779, 442439, 1202609, 3269029, 8886113, 24154957, 65660003, 178482319, 485165237, 1318815761, 3584912873, 9744803489, 26489122147, 72004899361, 195729609461, 532048240609, 1446257064299, 3931334297161
Offset: 0

Views

Author

Joseph L. Pe, Sep 26 2002

Keywords

Examples

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

Crossrefs

Programs

  • Mathematica
    a[n_] := NextPrime[Exp[n]]; a /@ Range[0, 20] (* Giovanni Resta, Apr 03 2017 *)
  • PARI
    for(n=1,50,print1(nextprime(exp(n))","))

Formula

Limmit_{n -> infinity} a(n+1)/a(n) = e. - Jonathan Vos Post, Apr 30 2006

Extensions

More terms from Ralf Stephan, Mar 25 2003
Edited by N. J. A. Sloane, Dec 22 2006
a(18) inserted and more terms added by Amiram Eldar, Sep 30 2019