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 A100965 #9 Jul 10 2018 12:09:37
%S A100965 5,11,29,97,127,127,127,541,541,907,1151,1361,1361,1361,1361,1361,
%T A100965 1361,9587,15727,15727,15727,15727,19661,19661,19661,19661,31469,
%U A100965 31469,31469,31469,31469,31469,31469,31469,31469,31469,156007,156007,156007,156007
%N A100965 Smallest prime number that ends a prime gap of at least 2n.
%C A100965 The second Mathematica program below generates the first 40 terms of the sequence given a value for nn of 15000. To generate the first 50 terms of the sequence the value of nn needs to be increased to about 32000. If a given value of nn is too low for the number of terms desired, this problem will be signaled by one or more of the generated terms being "NotFound" in which case increasing the value of nn appropriately should permit generating the desired number of terms. - _Harvey P. Dale_, Jul 10 2018
%H A100965 Harvey P. Dale, <a href="/A100965/b100965.txt">Table of n, a(n) for n = 1..100</a>
%e A100965 a(5)=a(6)=a(7)=127 because there is a gap of 14 between 113 and 127.
%t A100965 k=1; Table[While[Prime[k+1]-Prime[k] < 2n, k++ ]; Prime[k+1], {n, 48}]
%t A100965 Module[{nn=15000,pr,lst},pr=Prime[Range[2,nn]];lst=Thread[{pr,PadLeft[ Differences[ pr],nn-1]}];Table[SelectFirst[lst,#[[2]]>=2n&],{n,40}]][[All,1]] (* See Comment, above *) (* This program is several thousand times faster than the first program above *) (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 08 2018 *)
%Y A100965 Cf. A100964.
%K A100965 nonn
%O A100965 1,1
%A A100965 _T. D. Noe_, Nov 23 2004