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 A088684 #14 Dec 15 2019 21:56:24
%S A088684 6,6,8,6,8,6,10,6,6,10,12,10,8,6,24,6,12,12,10,24,6,16,10,12,14,18,12,
%T A088684 10,6,20,12,14,16,8,16,8,6,12,12,16,18,18,10,10,18,14,6,24,6,6,24,18,
%U A088684 12,10,14,10,12,12,8,6,12,12,12,16,20,12,18,20,8,6,14,40,26,18,10,6,22,6
%N A088684 Prime(3n+3)-prime(3n+1).
%C A088684 Minimal difference is 6 (for 3-tuplet). Repeating 6 means successive 3-tuplets.
%H A088684 Robert Israel, <a href="/A088684/b088684.txt">Table of n, a(n) for n = 1..10000</a>
%F A088684 Partition primes in triples starting with 7: {7, 11, 13}, {17, 19, 23}, {29, 31, 37}, {41, 43, 47}, {53, 59, 61}, {67, 71, 73}, {79, 83, 89}, {97, 101, 103}, {107, 109, 113}. Sequence gives differences between lesser and larger primes in triples.
%p A088684 Primes:= select(isprime, [2,seq(i,i=3..10000)]):
%p A088684 seq(Primes[3*n+3]-Primes[3*n+1],n=1..(nops(Primes)-3)/3); # _Robert Israel_, Dec 15 2019
%t A088684 Last[#]-First[#]&/@Partition[Prime[Range[4,250]],3] (* _Harvey P. Dale_, Sep 06 2011 *)
%Y A088684 Cf. A088680, A078584, A088682, A088683.
%K A088684 base,easy,nonn
%O A088684 1,1
%A A088684 _Zak Seidov_, Oct 05 2003