A101300 Second-smallest prime larger than n.

3, 3, 5, 7, 7, 11, 11, 13, 13, 13, 13, 17, 17, 19, 19, 19, 19, 23, 23, 29, 29, 29, 29, 31, 31, 31, 31, 31, 31, 37, 37, 41, 41, 41, 41, 41, 41, 43, 43, 43, 43, 47, 47, 53, 53, 53, 53, 59, 59, 59, 59, 59, 59, 61, 61, 61, 61, 61, 61, 67, 67, 71, 71, 71, 71, 71, 71, 73, 73, 73, 73

Offset: 0

Author

Zak Seidov, Apr 29 2005

Keywords

• nonn
• easy

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Programs

Haskell

a101300 = a151800 . a151800  -- Reinhard Zumkeller, Jun 02 2013

PARI

a(n)=nextprime(nextprime(n+1)+1) \\ Charles R Greathouse IV, Nov 16 2016

Python

from sympy import nextprime
def a(n): return nextprime(nextprime(n))
print([a(n) for n in range(71)]) # Michael S. Branicky, Mar 03 2021

Formula

a(n) = prime(pi(n)+2).

From Reinhard Zumkeller, Jun 03 2013: (Start)

a(n) = A151800(A151800(n)).

For n>0: a(n) = A000040(A000720(n)+2). (End)