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 A114227 #8 Oct 31 2013 17:29:17
%S A114227 3,3,3,3,3,5,3,7,3,3,3,5,3,3,7,3,3,13,3,5,3,7,3,3,3,3,11,7,5,3,7,5,7,
%T A114227 3,3,5,3,3,7,5,3,3,7,17,11,3,3,5,3,19,5,3,3,3,7,3,3,13,5,7,3,3,17,7,3,
%U A114227 5,3,5,3,7,3,3,5,3,37,11,19,5,7,5,13,3,5,3,7,3,3,23,37,31,11,43,5,3,7,13,17
%N A114227 Smallest odd prime q such that 2q + prime(n) is prime.
%H A114227 Reinhard Zumkeller, <a href="/A114227/b114227.txt">Table of n, a(n) for n = 3..10000</a>
%t A114227 Table[p1 = Prime[n1]; n2 = 2; p2 = 3; While[ cp = p1 + 2*p2; ! PrimeQ[cp], n2++; p2 = Prime[n2]]; p2, {n1, 3, 202}]
%o A114227 (Haskell)
%o A114227 a114227 n = head [p | p <- tail a000040_list,
%o A114227 a010051' (2 * p + a000040 n) == 1]
%o A114227 -- _Reinhard Zumkeller_, Oct 29 2013
%Y A114227 Cf. A000040, A010051, A114228.
%K A114227 easy,nonn
%O A114227 3,1
%A A114227 _Lei Zhou_, Nov 18 2005