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!)
 A088047 Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j. 3
 5, 5, 7, 17, 13, 29, 19, 41, 53, 31, 67, 79, 43, 89, 97, 109, 61, 127, 137, 73, 149, 163, 173, 181, 197, 103, 211, 109, 223, 229, 257, 269, 139, 281, 151, 307, 317, 331, 337, 349, 181, 367, 193, 389, 199, 401, 433, 449, 229, 461, 479, 241, 487, 509, 521, 557 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS If prime(m), prime(m+1) form a twin prime pair then a(m) = prime(m+1). LINKS EXAMPLE a(5) = 13 as 13-2 =11, a(8) = 41 as 41-3 = 38 = 2*19. PROG (PARI) r=Set(); forprime(n=2, 10^5, s=r; forprime(k=n, 10^5, if(setsearch(s, k%n), print1(" ", k); break, s=setunion(s, [k%n]))); r=setunion(r, [n])) (Alekseyev) CROSSREFS Cf. A088046. Sequence in context: A093307 A264388 A141392 * A109257 A088048 A006146 Adjacent sequences:  A088044 A088045 A088046 * A088048 A088049 A088050 KEYWORD nonn AUTHOR Amarnath Murthy, Sep 20 2003 EXTENSIONS More terms from Max Alekseyev, Feb 14 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 September 25 13:01 EDT 2020. Contains 337344 sequences. (Running on oeis4.)