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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261323 Smallest m such that prime(m+n-1) - prime(m) = A008407(n); that is, prime(m) starts the smallest n-tuplet of consecutive primes of length A008407(n). 4
1, 2, 3, 2, 3, 4, 5, 5, 4, 3, 3, 5, 5, 5, 5, 4, 6, 6, 6, 10, 10, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

See A261324 for further comments and the relation to A065688.

LINKS

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

FORMULA

a(n) = A000720(A261324(n)). - M. F. Hasler, Aug 17 2015

PROG

(PARI) A261323(n, d=A008407[n], m=0)={until(prime(m+n)==prime(m++)+d, ); m} \\ Assumes a precomputed vector A008407 with at least n elements, or supply the gap as 2nd arg. Inefficient for n>23. - M. F. Hasler, Aug 17 2015

CROSSREFS

Cf. A008407, A261324.

Sequence in context: A110516 A187180 A256992 * A134986 A216209 A289172

Adjacent sequences:  A261320 A261321 A261322 * A261324 A261325 A261326

KEYWORD

nonn,more

AUTHOR

Max Alekseyev, Aug 14 2015

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 February 22 18:27 EST 2018. Contains 299469 sequences. (Running on oeis4.)