The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249419 Least prime p>=prime(n) such that p + 2 == 0 (mod prime(n)). 2
 2, 7, 13, 19, 31, 37, 83, 131, 67, 317, 277, 109, 367, 127, 139, 157, 293, 181, 199, 211, 509, 709, 911, 443, 677, 503, 307, 2459, 761, 337, 379, 653, 409, 971, 743, 3169, 1097, 487, 499, 863, 1609, 541, 571, 577, 983, 1789, 631, 1559, 6581, 1601, 1163, 1193, 3613, 751, 769, 787, 2957 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Zak Seidov, Table of n, a(n) for n = 1..1000 PROG (PARI) a(n) = {pn = prime(n); forprime(p = pn, , if (((p+2) % pn) == 0, return (p)); ); } \\ Michel Marcus, Oct 29 2014 CROSSREFS Sequence in context: A156012 A106011 A045375 * A331544 A237499 A231476 Adjacent sequences: A249416 A249417 A249418 * A249420 A249421 A249422 KEYWORD nonn AUTHOR Zak Seidov, Oct 28 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 20 23:17 EDT 2024. Contains 374461 sequences. (Running on oeis4.)