Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Aug 17 2015 19:09:10
%S 1,2,3,2,3,4,5,5,4,3,3,5,5,5,5,4,6,6,6,10,10,4,4
%N 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).
%C See A261324 for further comments and the relation to A065688.
%F a(n) = A000720(A261324(n)). - _M. F. Hasler_, Aug 17 2015
%o (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
%Y Cf. A008407, A261324.
%K nonn,more
%O 1,2
%A _Max Alekseyev_, Aug 14 2015