A060264 First prime after 2n.

2, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 29, 29, 29, 31, 37, 37, 37, 41, 41, 43, 47, 47, 53, 53, 53, 59, 59, 59, 61, 67, 67, 67, 71, 71, 73, 79, 79, 79, 83, 83, 89, 89, 89, 97, 97, 97, 97, 101, 101, 103, 107, 107, 109, 113, 113, 127, 127, 127, 127, 127, 127, 127, 131

Offset: 0

Author

Labos Elemer, Mar 23 2001

Keywords

• nonn
• easy

Comments

Conjecture: for n > 2, this is the least prime p such that 1^2, 2^2, 3^2, ..., n^2 are distinct mod p. Checked to 10^4. - Charles R Greathouse IV, Dec 03 2022

Links

• Harry J. Smith, Table of n, a(n) for n = 0..1000

Crossrefs

Cf. A020482, A049653, A059786, A060308, A088633, A151800.

Cf. A005843.

Programs

Haskell

a060264 = a151800 . (* 2)  -- Reinhard Zumkeller, Nov 15 2013

Maple

A060264 := proc(n)
        nextprime(2*n) ;
end proc:

Mathematica

Table[NextPrime[2n],{n,0,100}] (* Vladimir Joseph Stephan Orlovsky, Mar 03 2011 *)

PARI

a(n) = nextprime(2*n + 1)  \\ Harry J. Smith, Jul 03 2009

Formula

a(n) = A151800(2*n). - Reinhard Zumkeller, Nov 15 2013