|
|
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
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|