The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136020 Smallest prime of the form (2*n+1)*prime(k)-2*n, any k. 57

%I

%S 7,11,29,19,23,53,31,103,191,43,47,101,109,59,311,67,71,149,79,83,173,

%T 181,283,197,103,107,331,229,709,367,127,131,269,139,853,293,151,463,

%U 317,163,167,1021,349,179,547,373,191,389,199,607,619,211,643,1091,223

%N Smallest prime of the form (2*n+1)*prime(k)-2*n, any k.

%C The associated prime(k) are in A136019.

%H Charles R Greathouse IV, <a href="/A136020/b136020.txt">Table of n, a(n) for n = 1..10000</a>

%e a(1)=7 because 7 is smallest prime p such that (p+2)/3 is prime

%e a(2)=11 because 11 is smallest prime p such that (p+4)/5 is prime

%e a(3)=29 because 29 is smallest prime p such that (p+6)/7 is prime

%t a = {}; Do[k = 1; While[ !PrimeQ[(Prime[k] + 2n)/(2n + 1)], k++ ]; AppendTo[a, Prime[k]], {n, 1, 100}]; a

%t Reap[Do[k = PrimePi[2n+1]; While[ !PrimeQ[((p=Prime[k]) + 2n)/(2n + 1)], k++ ]; Sow[p], {n, 100}]][[2,1]] (* _Zak Seidov_, Mar 04 2013 *)

%o (PARI) a(n)=my(t);n+=n;forprime(p=2,default(primelimit),if(isprime(t=(n+1)*p-n),return(t))) \\ _Charles R Greathouse IV_, Feb 13 2011

%Y Cf. A136019, A136026, A136027.

%K nonn,easy

%O 1,1

%A _Artur Jasinski_, Dec 10 2007

%E Edited by _R. J. Mathar_, May 17 2009

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.

Last modified April 11 02:59 EDT 2021. Contains 342886 sequences. (Running on oeis4.)