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 A073703 #15 Mar 29 2015 11:46:01
%S A073703 3,5,3,3,7,3,3,3,7,3,5,5,7,3,3,3,13,5,3,7,3,5,7,3,3,31,5,13,5,3,3,7,3,
%T A073703 3,13,5,3,5,3,3,31,5,7,3,3,3,11,3,3,3,13,13,5,7,7,31,3,5,3,7,3,7,3,19,
%U A073703 5,7,11,3,7,3,3,43,5,5,3,3,19,3,7,3,19,11,19,11,3,43,13,5,7,3,3,13,3
%N A073703 Smallest prime p such that also p+prime(n)*2 is a prime.
%C A073703 If Polignac's conjecture (1849) is correct, the sequence is defined for all n (as is A020483).
%C A073703 Also: least k-prime(n) such that k-prime(n) and k+prime(n) are both primes. - _Pierre CAMI_, Aug 27 2004
%H A073703 Charles R Greathouse IV, <a href="/A073703/b073703.txt">Table of n, a(n) for n = 1..10000</a>
%e A073703 n=5: prime(5)=11; 2+11*2=24, 3+11*2=25 and 5+11*2=27 are not prime, but 7+11*2=29 is prime, therefore a(5)=7.
%t A073703 f[n_] := Block[{k = Prime[n], p = Prime[n]}, While[ !PrimeQ[k - p] || !PrimeQ[k + p], k++ ]; k - p]; Table[ f[n], {n, 95}] (* _Robert G. Wilson v_, Aug 28 2004 *)
%o A073703 (PARI) forprime(q=2,500,forprime(p=2,default(primelimit),if(isprime(2*q+p),print1(p", ");next(2)));error("Not enough precomputed primes")) \\ _Charles R Greathouse IV_, Aug 21 2011
%o A073703 (Haskell)
%o A073703 a073703 n = head [p | p <- a000040_list, a010051 (p + 2 * a000040 n) == 1]
%o A073703 -- _Reinhard Zumkeller_, Oct 29 2013
%Y A073703 Cf. A073704, A001747, A000040, A020483.
%Y A073703 Cf. A010051.
%K A073703 nonn
%O A073703 1,1
%A A073703 _Reinhard Zumkeller_, Aug 04 2002
%E A073703 Merged with Pierre CAMI's submission of Aug 2004 - _R. J. Mathar_, Jul 29 2008