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!)
 A100742 Smallest prime p such that (p+prime(n))/2 is prime. 1
 2, 3, 5, 3, 3, 13, 5, 3, 3, 5, 3, 37, 5, 3, 11, 5, 3, 13, 7, 3, 13, 3, 3, 5, 37, 5, 3, 11, 13, 5, 7, 3, 5, 3, 17, 7, 37, 3, 11, 5, 23, 13, 3, 13, 5, 3, 3, 3, 47, 73, 29, 23, 13, 3, 5, 11, 5, 3, 37, 17, 19, 5, 7, 3, 13, 17, 3, 61, 11, 13, 5, 3, 19, 13, 3, 3, 5, 61, 53, 13, 3, 37, 23, 13, 7, 3, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS PROG (PARI) a(n) = {if (n==1, return (2)); p = 3; while(! isprime((prime(n)+p)/2), p = nextprime(p+1)); return (p); } \\ Michel Marcus, Jun 16 2013 CROSSREFS Cf. A084704. Sequence in context: A131971 A321882 A281158 * A001269 A201769 A077276 Adjacent sequences:  A100739 A100740 A100741 * A100743 A100744 A100745 KEYWORD easy,nonn,less AUTHOR David Wasserman, Jan 03 2005 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 April 22 19:11 EDT 2021. Contains 343177 sequences. (Running on oeis4.)