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 A200996 #10 Jul 13 2013 12:04:19
%S A200996 3,2,2,1,4,1,4,2,2,2,4,1,8,2,2,2,6,1,10,2,2,2,6,3,6,4,4,3,6,1,10,3,4,
%T A200996 3,4,2,4,5,6,2,4,1,6,2,4,3,6,2,4,3,2,2,4,2,6,3,4,3,12,1,8,5,4,3,6,2,6,
%U A200996 2,2,2,8,1,14,2,2,3,6,3,4,3,8,2,4,4,12
%N A200996 Least upper limit for numbers u and v such that u*n-1 and v*n+1 are both prime, u and v not necessarily distinct.
%C A200996 A103689(n) <= a(n) <= A071558(n).
%H A200996 Reinhard Zumkeller, <a href="/A200996/b200996.txt">Table of n, a(n) for n = 1..10000</a>
%F A200996 a(n) = max {A053989(n), A034693(n)}.
%o A200996 (Haskell)
%o A200996 a200996 n = max (a053989 n) (a034693 n)
%K A200996 nonn
%O A200996 1,1
%A A200996 _Reinhard Zumkeller_, Feb 14 2013