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 A204807 #14 Aug 03 2020 15:25:40
%S A204807 378043979,436402859,481691513,496333259,529811591,566348087,
%T A204807 587673143,613621031,642407387,707840657,735533657,739358843,
%U A204807 751127249,756470279,776996897,782602013,783476651,796714157,803011589,819905759,888967283
%N A204807 Primes followed by a gap of 200 = nextprime(p) - p.
%C A204807 All terms == 5 (mod 6). - _Zak Seidov_, Apr 04 2013
%H A204807 Zak Seidov, <a href="/A204807/b204807.txt">Table of n, a(n) for n = 1..5000</a>
%H A204807 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>.
%F A204807 a(n) = A000040(A116497(n)).
%t A204807 Select[Partition[Prime[Range[455*10^5]],2,1],#[[2]]-#[[1]]==200&][[All,1]] (* The program may take a long time to run. *) (* _Harvey P. Dale_, Aug 03 2020 *)
%o A204807 (PARI) list_gaps(g=200,f,N=100)={my(p=0); for(c=1, N, while(g+p!=p=nextprime(p+1), ); if(f,write(f".txt",c" ",p-g),print1(", "p-g)))}
%K A204807 nonn
%O A204807 1,1
%A A204807 _M. F. Hasler_, Jan 19 2012