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