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 A136027 #8 May 13 2013 01:54:09
%S A136027 3,3,5,5,3,7,3,3,5,3,5,5,3,5,13,3,3,11,5,3,5,3,5,5,19,3,7,3,5,7,3,5,5,
%T A136027 11,3,13,5,3,7,7,3,5,3,17,7,5,3,11,5,23,5,3,5,5,3,5,7,3,11,7,3,3,5,5,
%U A136027 3,5,5,3,11,3,3,13,3,11,11,7,3,5,5,3,5,3,11,5,3,3,5,5
%N A136027 Smallest prime of the form (p-2n)/(2n+1) with p prime.
%C A136027 The associated p are in A136026.
%H A136027 Charles R Greathouse IV, <a href="/A136027/b136027.txt">Table of n, a(n) for n = 1..10000</a>
%e A136027 a(1)=3 because 3 is smallest prime of the form (p-2)/3; in this case prime(k)=11.
%e A136027 a(2)=3 because 3 is smallest prime of the form (p-4)/5; in this case prime(k)=19.
%e A136027 a(3)=5 because 5 is smallest prime of the form (p-6)/7; in this case prime(k)=41.
%t A136027 a = {}; Do[k = 1; While[ !PrimeQ[(Prime[k] - 2n)/(2n + 1)], k++ ]; AppendTo[a, (Prime[k] - 2n)/(2n + 1)], {n, 1, 100}]; a
%o A136027 (PARI) a(n)=forprime(p=2,,if(isprime(2*n*(p+1)+p),return(p))) \\ _Charles R Greathouse IV_, Mar 21 2013
%Y A136027 Cf. A136019, A136020, A136026.
%K A136027 nonn,easy
%O A136027 1,1
%A A136027 _Artur Jasinski_, Dec 10 2007
%E A136027 Edited by _R. J. Mathar_, May 17 2009