cp's OEIS Frontend

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.

A263049 a(n) = smallest prime p(k) such that the gaps between the primes p(k), p(k+1), p(k+2), ..., p(k+n) are 2n, 2n-2, ... 6, 4, 2.

This page as a plain text file.
%I A263049 #36 Jul 10 2016 14:16:01
%S A263049 3,7,31,1979,41203,752251,5647457,32465047,245333233,245333213,
%T A263049 27797667517,196559847120517,3040284075731561,253253149671986983
%N A263049 a(n) = smallest prime p(k) such that the gaps between the primes p(k), p(k+1), p(k+2), ..., p(k+n) are 2n, 2n-2, ... 6, 4, 2.
%H A263049 Dmitry Petukhov, <a href="/A263049/b263049.txt">Table of n, a(n) for n = 1..14</a>
%e A263049 Consider the consecutive primes 1979, 1987, 1993, 1997, 1999. The gaps are 8, 6, 4, 2, and this does not occur for any prime smaller than 1979, so a(4)=1979.
%Y A263049 Cf. A016045.
%K A263049 nonn,more
%O A263049 1,1
%A A263049 _Vasily Danilov_, Oct 08 2015
%E A263049 a(12)-a(13) from _Dmitry Petukhov_, Oct 08 2015
%E A263049 a(14) from _Dmitry Petukhov_, Jul 09 2016