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

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!)
 A117673 a(n) is the least k such that k*2*prime(n) + 1 is prime. 4
 1, 1, 1, 2, 1, 2, 3, 5, 1, 1, 5, 2, 1, 2, 3, 1, 6, 3, 2, 4, 2, 2, 1, 1, 2, 3, 3, 3, 5, 1, 2, 1, 3, 2, 4, 3, 5, 2, 7, 1, 1, 3, 1, 2, 9, 2, 5, 6, 12, 6, 1, 1, 3, 1, 3, 3, 4, 3, 2, 1, 3, 1, 2, 3, 3, 13, 3, 5, 3, 5, 7, 1, 3, 2, 6, 6, 12, 3, 4, 2, 1, 5, 1, 2, 5, 1, 4, 15, 3, 6, 3, 4, 2, 1, 2, 3, 1, 16, 5, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Iff a(n) = 1, prime(n) is a Sophie Germain prime, i.e., in A005384. - A.H.M. Smeets, Feb 01 2018 LINKS Zak Seidov, Table of n, a(n) for n = 1..10000 EXAMPLE a(8)=5 because 2*prime(8)=38 and 5*38 + 1 is prime. MATHEMATICA Table[k := 1; While[ ! PrimeQ[2*k*Prime[n] + 1], k++ ]; k, {n, 1, 120}] (* Stefan Steinerberger, May 01 2006 *) PROG (PARI) a(n) = {my(p=prime(n), k=1); while (!isprime(2*k*p+1), k++); k; } \\ Michel Marcus, Feb 12 2018 CROSSREFS Cf. A016014, A074884. Sequence in context: A002730 A081664 A224926 * A107946 A054502 A059346 Adjacent sequences:  A117670 A117671 A117672 * A117674 A117675 A117676 KEYWORD nonn AUTHOR Don Reble, Apr 25 2006 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.

Last modified January 21 04:53 EST 2020. Contains 331104 sequences. (Running on oeis4.)