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 A214055 #8 Jul 26 2012 12:45:30
%S A214055 1,2,3,1,5,2,1,2,9,1,11,2,1,2,15,1,17,2,1,2,21,1,3,2,1,2,27,1,29,2,1,
%T A214055 2,3,1,35,2,1,2,39,1,41,2,1,2,45,1,5,2,1,2,51,1,3,2,1,2,57,1,59,2,1,2,
%U A214055 3,1,65,2,1,2,69,1,71,2,1,2,5,1,77,2,1,2
%N A214055 Least m>0 such that n!+2+m and n-m have a common divisor > 1.
%H A214055 Clark Kimberling, <a href="/A214055/b214055.txt">Table of n, a(n) for n = 1..1000</a>
%e A214055 6!+2+1=723, 6-1=5; 6!+2+2=724, 6-2=4; so a(6)=2.
%t A214055 b[n_] := n! + 2; c[n_] := n; Table[m = 1; While[GCD[b[n] + m, c[n] - m] == 1, m++]; m, {n, 100}]
%Y A214055 Cf. A020639, A060680.
%K A214055 nonn,easy
%O A214055 1,2
%A A214055 _Clark Kimberling_, Jul 22 2012