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!)
 A254863 Least prime p such that p + previousprime(p) is a multiple of n. 1
 3, 5, 7, 5, 3, 7, 23, 5, 11, 17, 101, 7, 29, 23, 17, 59, 37, 11, 79, 31, 23, 101, 71, 13, 53, 29, 83, 43, 349, 17, 97, 67, 101, 37, 107, 19, 113, 79, 41, 61, 211, 23, 89, 157, 47, 71, 283, 73, 443, 53, 103, 29, 641, 83, 167, 59, 229, 349, 239, 31, 613, 97, 317, 67, 197, 101, 137, 37, 71, 107, 431, 73 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For examples see A254862. LINKS MATHEMATICA s={}; Do[p=2; q=3; While[Mod[p+q, n]>0, p=q; q=NextPrime[q]]; AppendTo[s, q], {n, 50}]; s PROG (PARI) s=[]; for(n=1, 50, p=2; q=3; while((p+q)%n>0, p=q; q=nextprime(q+1)); s=concat(s, q)); s CROSSREFS Cf. A254862. Sequence in context: A023899 A324712 A279321 * A085965 A238205 A186702 Adjacent sequences:  A254860 A254861 A254862 * A254864 A254865 A254866 KEYWORD nonn AUTHOR Zak Seidov, Feb 09 2015 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 May 28 04:00 EDT 2020. Contains 334671 sequences. (Running on oeis4.)