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 A276812 #14 Nov 05 2016 12:10:20
%S A276812 0,0,0,2,0,2,0,2,2,0,4,2,0,2,0,2,0,4,2,0,4,2,2,4,2,0,2,0,2,4,2,2,0,2,
%T A276812 0,0,4,2,0,2,0,2,0,2,0,0,4,2,0,2,2,0,6,0,0,2,0,4,2,0,4,4,2,0,2,6,4,2,
%U A276812 0,2,2,6,0,4,2,2,4,0,2,2,0,2,0,4,2,2,4,2,0,0,8,4,0,4,2,0,2,0,6,4
%N A276812 Prime gap residues mod previous prime gap.
%H A276812 János Pintz, <a href="http://arxiv.org/abs/1406.2658">On the ratio of consecutive gaps between primes</a>, arXiv:1406.2658 [math.NT], 2014.
%H A276812 János Pintz, <a href="http://dx.doi.org/10.1007/978-3-319-22240-0_17">On the Ratio of Consecutive Gaps Between Primes</a>, in Carl Pomerance and Michael Th. Rassias, Analytic Number Theory; In Honor of Helmut Maier’s 60th Birthday, Springer International Publishing, 2015, ISBN 978-3-319-22239-4, pp. 285-304.
%e A276812 For n = 4: prime(4+2) = 13, prime(4+1) = 11 and prime(4) = 7. (13-11) % (11-7) = 2 % 4 = 2, so a(4) = 2. - _Felix Fröhlich_, Oct 04 2016
%t A276812 Table[Mod[Prime[n + 2] - Prime[n + 1], Prime[n + 1] - Prime[n]], {n, 1, 100, 1}]
%o A276812 (PARI) a(n) = (prime(n+2)-prime(n+1)) % (prime(n+1)-prime(n)) \\ _Felix Fröhlich_, Oct 04 2016
%Y A276812 Cf. A274263, A272863, A274225.
%K A276812 nonn
%O A276812 1,4
%A A276812 _Andres Cicuttin_, Sep 18 2016