cp's OEIS Frontend

A060264 First prime after 2n.

%I A060264 #31 Dec 11 2024 23:41:20
%S A060264 2,3,5,7,11,11,13,17,17,19,23,23,29,29,29,31,37,37,37,41,41,43,47,47,
%T A060264 53,53,53,59,59,59,61,67,67,67,71,71,73,79,79,79,83,83,89,89,89,97,97,
%U A060264 97,97,101,101,103,107,107,109,113,113,127,127,127,127,127,127,127,131
%N A060264 First prime after 2n.
%C A060264 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
%H A060264 Harry J. Smith, <a href="/A060264/b060264.txt">Table of n, a(n) for n = 0..1000</a>
%F A060264 a(n) = A151800(2*n). - _Reinhard Zumkeller_, Nov 15 2013
%p A060264 A060264 := proc(n)
%p A060264         nextprime(2*n) ;
%p A060264 end proc:
%t A060264 Table[NextPrime[2n],{n,0,100}] (* _Vladimir Joseph Stephan Orlovsky_, Mar 03 2011 *)
%o A060264 (PARI) a(n) = nextprime(2*n + 1)  \\ _Harry J. Smith_, Jul 03 2009
%o A060264 (Haskell)
%o A060264 a060264 = a151800 . (* 2)  -- _Reinhard Zumkeller_, Nov 15 2013
%Y A060264 Cf. A020482, A049653, A059786, A060308, A088633, A151800.
%Y A060264 Cf. A005843.
%K A060264 nonn,easy
%O A060264 0,1
%A A060264 _Labos Elemer_, Mar 23 2001