This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A261323 #11 Aug 17 2015 19:09:10
%S A261323 1,2,3,2,3,4,5,5,4,3,3,5,5,5,5,4,6,6,6,10,10,4,4
%N 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).
%C A261323 See A261324 for further comments and the relation to A065688.
%F A261323 a(n) = A000720(A261324(n)). - _M. F. Hasler_, Aug 17 2015
%o A261323 (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 A261323 Cf. A008407, A261324.
%K A261323 nonn,more
%O A261323 1,2
%A A261323 _Max Alekseyev_, Aug 14 2015