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).

1, 2, 3, 2, 3, 4, 5, 5, 4, 3, 3, 5, 5, 5, 5, 4, 6, 6, 6, 10, 10, 4, 4

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 A336860 A216209

Adjacent sequences: A261320 A261321 A261322 * A261324 A261325 A261326

Keyword

nonn,more

Author

Max Alekseyev, Aug 14 2015

Status

approved