login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103966 Let p(k) = k-th prime. a(n) = smallest prime p(j) such that number of solutions to p(k)-p(k-1)=m is n, where 1<k<=j. 1
3, 7, 13, 19, 31, 43, 61, 73, 103, 109, 131, 151, 181, 193, 199, 229, 241, 271, 283, 313, 349, 389, 433, 449, 491, 503, 563, 569, 577, 593, 599, 607, 613, 653, 659, 683, 733, 739, 757, 947, 953, 977 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

a(2)=7 since if m=2, then there are two solutions (7-5=2), (5-3=2).

CROSSREFS

Cf. A001223.

Sequence in context: A231432 A271981 A103521 * A023237 A106061 A155703

Adjacent sequences:  A103963 A103964 A103965 * A103967 A103968 A103969

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto, Mar 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 16:03 EDT 2021. Contains 343980 sequences. (Running on oeis4.)