login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088046 Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j > n. 2
5, 11, 17, 31, 41, 43, 53, 61, 83, 89, 103, 127, 149, 139, 167, 167, 179, 193, 223, 239, 229, 241, 263, 281, 307, 311, 313, 353, 331, 353, 421, 401, 431, 457, 449, 499, 487, 499, 557, 557, 557, 601, 593, 613, 593, 631, 661, 673, 683, 691, 743, 719, 733, 773 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..54.

EXAMPLE

a(1) = 5 as 5-3 == 0 (mod 2), a(5) = 41 as 41- 19 ==0 (mod 11). (No two primes between 13 and 37 differ by a multiple of 11.)

CROSSREFS

Cf. A088047.

Sequence in context: A231652 A068072 A136292 * A155882 A087373 A155030

Adjacent sequences:  A088043 A088044 A088045 * A088047 A088048 A088049

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Sep 20 2003

EXTENSIONS

More terms from David Wasserman, Jun 22 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 26 05:25 EDT 2017. Contains 287077 sequences.