The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101300 Second-smallest prime larger than n. 6
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 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) PROG (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 CROSSREFS Sequence in context: A222657 A050826 A086910 * A172290 A076524 A168279 Adjacent sequences: A101297 A101298 A101299 * A101301 A101302 A101303 KEYWORD nonn,easy AUTHOR Zak Seidov, Apr 29 2005 STATUS approved

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.

Last modified December 6 20:17 EST 2023. Contains 367614 sequences. (Running on oeis4.)