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 A136026 #8 May 13 2013 01:54:09
%S A136026 11,19,41,53,43,103,59,67,113,83,137,149,107,173,433,131,139,443,233,
%T A136026 163,257,179,281,293,1019,211,439,227,353,487,251,389,401,827,283,
%U A136026 1021,449,307,631,647,331,509,347,1601,727,557,379,1163,593,2423,617,419,641
%N A136026 Smallest prime of the form (2n+1)p + 2n with p prime.
%C A136026 The associated p are in A136027.
%H A136026 Charles R Greathouse IV, <a href="/A136026/b136026.txt">Table of n, a(n) for n = 1..10000</a>
%e A136026 a(1)=11 because 11 is smallest prime p such that (p-2)/3 is prime.
%e A136026 a(2)=19 because 19 is smallest prime p such that (p-4)/5 is prime.
%e A136026 a(3)=41 because 41 is smallest prime p such that (p-6)/7 is prime.
%t A136026 a = {}; Do[k = 1; While[ !PrimeQ[(Prime[k] - 2n)/(2n + 1)], k++ ]; AppendTo[a, Prime[k]], {n, 1, 100}]; a
%o A136026 (PARI) a(n)=my(t);forprime(p=2,,if(isprime(t=2*n*(p+1)+p),return(t))) \\ _Charles R Greathouse IV_, Mar 21 2013
%Y A136026 Cf. A136019, A136020, A136027.
%K A136026 nonn,easy
%O A136026 1,1
%A A136026 _Artur Jasinski_, Dec 10 2007
%E A136026 Edited by _R. J. Mathar_, May 17 2009