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 A112824 #4 Mar 30 2012 17:31:17
%S A112824 0,0,0,2,0,4,2,2,4,8,6,10,6,6,10,14,12,12,14,14,10,20,14,16,18,16,16,
%T A112824 24,22,28,20,24,24,26,26,34,26,32,30,38,36,40,36,36,28,42,36,18,44,38,
%U A112824 40,50,42,40,50,48,40,54,52,48,42,46,42,56,56,64,48,60,64,68,66,66,48,60
%N A112824 Consider the Goldbach conjecture that every even number 2n=p+p' with p<=p'. Consider all such Goldbach partitions; a(n) is the difference between the largest p and the smallest p. Call this difference the Goldbach gap.
%C A112824 The gap is always even.
%H A112824 T. D. Noe, <a href="/A112824/b112824.txt">Table of n, a(n) for n = 2..1000</a>
%F A112824 A112823 - A020481.
%t A112824 f[n_] := Block[{p = 2, q = n/2}, While[ !PrimeQ[p] || !PrimeQ[n - p], p++ ]; While[ !PrimeQ[q] || !PrimeQ[n - q], q-- ]; q - p]; Table[ f[n], {n, 4, 150, 2}]
%Y A112824 Cf. A020481.
%K A112824 nonn
%O A112824 2,4
%A A112824 _Robert G. Wilson v_, Sep 05 2005