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 A287049 #9 Oct 02 2019 11:39:50
%S A287049 1193,2699,5399,5693,6599,6899,7499,8093,8699,12899,13799,15299,17099,
%T A287049 17393,19793,20399,23993,26099,26399,27893,35099,35393,35999,36299,
%U A287049 36599,37493,38699,39293,40499,42299,43793,46499,50093,50993,51599,51899,53093,53993,55799,56393,57593,58199,59399,59699
%N A287049 Prime p1 of consecutive primes p1, p2, where p2 - p1 = 8, and p1, p2 are in different centuries.
%C A287049 Since a(n) and a(n)+8 are consecutive primes either a(n)+7 or a(n)+1 is a multiple of 100; in addition a(n) must have the form 6k-1. Therefore, every century spanned by a(n) and a(n)+8 is a multiple of 300. It appears that every multiple of 3 occurs as the difference round((a(n+1)-a(n))/100); all multiples of 3 through 432 occur as these differences for a(n) < 1000000000.
%H A287049 Harvey P. Dale, <a href="/A287049/b287049.txt">Table of n, a(n) for n = 1..1000</a>
%t A287049 a287049[n_] := Map[Last, Select[Map[{NextPrime[#, 1], NextPrime[#, -1]}&, Range[100, n, 100]], First[#]-Last[#]==8&]]
%t A287049 a287049[60000] (* data *)
%t A287049 Select[Partition[Prime[Range[6100]],2,1],#[[2]]-#[[1]]==8&&Floor[#[[1]]/ 100] != Floor[#[[2]]/100]&][[All,1]] (* _Harvey P. Dale_, Oct 02 2019 *)
%Y A287049 Cf. A001359, A158277, A160370, A160440, A160500.
%K A287049 nonn
%O A287049 1,1
%A A287049 _Hartmut F. W. Hoft_, May 18 2017