Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Jul 27 2016 02:20:34
%S 2,3,2,2,3,3,2,7,2,2,3,3,2,7,2,3,3,2,5,7,3,2,3,2,2,3,2,2,19,3,5,3,3,2,
%T 3,13,2,3,2,3,19,5,2,7,2,3,3,2,2,7,3,3,7,5,3,3,2,2,7,2,3,3,3,2,7,3,2,
%U 3,2,2,13,3,2,37,5,3,3,2,2,13,3,5,3,2,11,13,2,2,31,3,3,7,2,5,3,3,2,7,2,2
%N Smallest prime p such that 2n*p+1 is also prime.
%C These are the primes arising in A051899.
%H Michael De Vlieger, <a href="/A051686/b051686.txt">Table of n, a(n) for n = 1..10000</a>
%e a(29)=19 because 19 is the smallest prime p such that 2*29*p+1 is prime.
%t Table[k = 1; While[! PrimeQ[2 n Prime@ k + 1], k++]; Prime@ k, {n, 120}] (* _Michael De Vlieger_, Jul 26 2016 *)
%o (PARI) a(n) = p=2; while(!isprime(2*n*p+1), p = nextprime(p+1)); p; \\ _Michel Marcus_, Dec 10 2013
%Y Cf. A005384, A051644-A051654, A051899.
%K nonn
%O 1,1
%A _Labos Elemer_