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 A108184 #16 Aug 08 2015 21:56:10
%S A108184 2,3,7,11,23,31,41,47,67,71,83,109,113,131,139,149,167,193,197,233,
%T A108184 241,251,263,271,283,317,331,347,353,373,379,401,439,443,479,487,491,
%U A108184 503,523,541,563,571,577,587,613,619,641,727,733,761,787,809,863,877
%N A108184 a(n) = smallest prime such that a(n) + 2n is also prime and such that a(n) > a(n-1).
%C A108184 Increasing primes p such that p + 2n is prime.
%H A108184 T. D. Noe, <a href="/A108184/b108184.txt">Table of n, a(n) for n = 0..10000</a>
%e A108184 a(0)=2 since 2+0=2 is prime; a(1)=3 since 3+2=5 is prime.
%e A108184 a(2)=7 since 7+4=11 is prime; 5 is not in the sequence since 5+4=9 is not prime.
%p A108184 A108184 := proc(n) option remember; if n = 1 then 3; else for a from procname(n-1)+1 do if isprime(a) and isprime(a+2*n) then RETURN(a) ; fi; od: fi; end: seq(A108184(n),n=1..100) ; # _R. J. Mathar_, Jan 31 2009
%t A108184 t = {2}; Do[p = NextPrime[t[[-1]]]; While[! PrimeQ[p + 2 n], p = NextPrime[p]]; AppendTo[t, p], {n, 100}]; t (* _T. D. Noe_, Feb 04 2014 *)
%o A108184 (PARI) A108184(maxp) = {my(a=[2], n=1); forprime(p=3, maxp, if(isprime(p+2*n), n++; a=concat(a, p))); a} \\ _Colin Barker_, Feb 03 2014
%Y A108184 Cf. A020483, A237055
%K A108184 easy,nonn
%O A108184 0,1
%A A108184 _Giovanni Teofilatto_, Jun 28 2005
%E A108184 Edited and extended by _Ray Chandler_, Jul 07 2005
%E A108184 Edited by _N. J. A. Sloane_, Feb 11 2009 at the suggestion of _R. J. Mathar_