This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091313 Smallest prime x > n such that x (mod n) = x (mod p[n]), where p[n] is n-th prime. 0
 2, 7, 17, 29, 59, 79, 239, 157, 211, 293, 347, 449, 541, 607, 709, 853, 1009, 1103, 1277, 1423, 1543, 1741, 1913, 2137, 2437, 2633, 2789, 2999, 3163, 3391, 3943, 4201, 4523, 4729, 5227, 5437, 5813, 6197, 6521, 6947, 7349, 7603, 8219, 8501, 8867, 9157, 9923 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE a(2)=7 because p[2]=3 and x=7 is smallest prime > 2 such that x (mod 2)=x (mod 3). PROG (PARI) a(n) = {p = nextprime(n+1); while ( (p % n) != (p % prime(n)), p = nextprime(p+1)); p; } \\ Michel Marcus, Oct 05 2013 CROSSREFS Sequence in context: A031377 A019357 A024920 * A049554 A019398 A086513 Adjacent sequences:  A091310 A091311 A091312 * A091314 A091315 A091316 KEYWORD nonn AUTHOR Zak Seidov, Feb 21 2004 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 September 22 17:04 EDT 2019. Contains 327311 sequences. (Running on oeis4.)