|
%I #18 Mar 04 2021 02:31:20
%S 3,3,5,7,7,11,11,13,13,13,13,17,17,19,19,19,19,23,23,29,29,29,29,31,
%T 31,31,31,31,31,37,37,41,41,41,41,41,41,43,43,43,43,47,47,53,53,53,53,
%U 59,59,59,59,59,59,61,61,61,61,61,61,67,67,71,71,71,71,71,71,73,73,73,73
%N Second-smallest prime larger than n.
%H Reinhard Zumkeller, <a href="/A101300/b101300.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = prime(pi(n)+2).
%F From _Reinhard Zumkeller_, Jun 03 2013: (Start)
%F a(n) = A151800(A151800(n)).
%F For n>0: a(n) = A000040(A000720(n)+2). (End)
%o (Haskell)
%o a101300 = a151800 . a151800 -- _Reinhard Zumkeller_, Jun 02 2013
%o (PARI) a(n)=nextprime(nextprime(n+1)+1) \\ _Charles R Greathouse IV_, Nov 16 2016
%o (Python)
%o from sympy import nextprime
%o def a(n): return nextprime(nextprime(n))
%o print([a(n) for n in range(71)]) # _Michael S. Branicky_, Mar 03 2021
%K nonn,easy
%O 0,1
%A _Zak Seidov_, Apr 29 2005
|
