login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187873 Second smallest prime after n^2. 1

%I

%S 3,3,7,13,19,31,41,59,71,89,103,131,151,179,199,229,263,307,337,373,

%T 409,449,491,547,587,641,683,739,797,857,911,971,1033,1093,1171,1231,

%U 1301,1381,1451,1531,1607,1697,1783,1867,1951,2029

%N Second smallest prime after n^2.

%C From _Robert Israel_, Dec 18 2018: (Start)

%C Oppermann's conjecture implies a(n) < (n+1)^2 for n > 0.

%C For n > 1, a(n) >= n^2 + 3, with equality for n in A080149. (End)

%H Robert Israel, <a href="/A187873/b187873.txt">Table of n, a(n) for n = 0..10000</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Oppermann%27s_conjecture">Oppermann's conjecture</a>

%e 2^2=4, second smallest prime=7;

%e 3^2=9, second smallest prime=13; ..

%p seq(nextprime(nextprime(n^2)),n=0..50); # _Robert Israel_, Dec 18 2018

%t NextPrime[Range[0,100]^2, 2]

%Y Cf. A007491, A014210, A080149.

%K nonn

%O 0,1

%A _Vladimir Joseph Stephan Orlovsky_, Mar 14 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 04:56 EDT 2021. Contains 345056 sequences. (Running on oeis4.)