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 A063086 #14 Jun 26 2018 04:58:48
%S A063086 1,2,2,4,2,2,2,4,6,2,2,2,2,4,6,6,2,2,4,2,2,4,6,2,2,2,4,2,2,2,4,6,2,10,
%T A063086 2,2,2,4,6,6,2,2,2,2,2,4,4,4,2,2,6,2,2,6,6,6,2,2,2,2,2,14,4,2,2,2,2,2,
%U A063086 2,2,6,8,2,2,4,6,2,2,2,10,2,2,2,2,4,6,2,2,2,4,12,8,4,4,4,6,6,2,2,2,2,6
%N A063086 a(n) = gcd(1 + prime(n+1), 1 + prime(n)).
%H A063086 Harry J. Smith, <a href="/A063086/b063086.txt">Table of n, a(n) for n = 1..1000</a>
%e A063086 n=34: gcd(1 + 139, 1 + 149) = 10 = a(34).
%t A063086 GCD[First[#]+1,Last[#]+1]&/@ Partition[Prime[Range[110]],2,1] (* _Harvey P. Dale_, May 02 2012 *)
%o A063086 (PARI) a(n)={gcd(1 + prime(n+1), 1 + prime(n))} \\ _Harry J. Smith_, Aug 17 2009
%Y A063086 Cf. A058263.
%K A063086 easy,nonn
%O A063086 1,2
%A A063086 _Labos Elemer_, Aug 06 2001