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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187873 Second smallest prime after n^2. 1
3, 3, 7, 13, 19, 31, 41, 59, 71, 89, 103, 131, 151, 179, 199, 229, 263, 307, 337, 373, 409, 449, 491, 547, 587, 641, 683, 739, 797, 857, 911, 971, 1033, 1093, 1171, 1231, 1301, 1381, 1451, 1531, 1607, 1697, 1783, 1867, 1951, 2029 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

From Robert Israel, Dec 18 2018: (Start)

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

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

LINKS

Robert Israel, Table of n, a(n) for n = 0..10000

Wikipedia, Oppermann's conjecture

EXAMPLE

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

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

MAPLE

seq(nextprime(nextprime(n^2)), n=0..50); # Robert Israel, Dec 18 2018

MATHEMATICA

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

CROSSREFS

Cf. A007491, A014210, A080149.

Sequence in context: A116880 A051123 A096188 * A306665 A065876 A204858

Adjacent sequences:  A187870 A187871 A187872 * A187874 A187875 A187876

KEYWORD

nonn

AUTHOR

Vladimir Joseph Stephan Orlovsky, Mar 14 2011

STATUS

approved

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 January 20 14:02 EST 2020. Contains 331094 sequences. (Running on oeis4.)