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 A230138 #19 Apr 17 2016 09:25:19
%S A230138 5,11,17,29,59,71,101,137,149,179,197,227,281,311,431,599,617,641,809,
%T A230138 821,857,1151,1277,1319,1451,1481,1487,1607,1667,1697,1997,2027,2081,
%U A230138 2111,2129,2339,2657,2711,2789,3167,3329,3371,3461,3557,3767,3917,3929,4049,4217,4259
%N A230138 List of those primes p with p + 2 and 2*p - 5 both prime.
%C A230138 Clearly, all terms are congruent to 5 modulo 6, and not congruent to 3 modulo 5. Primes in this sequence are sparser than twin primes and Sophie Germain primes.
%C A230138 This sequence is interesting because of the conjectures in the comments in A230140 and A230141.
%C A230138 Intersection of A001359 and A089253 (or A063909). - _M. F. Hasler_, Oct 10 2013
%H A230138 Zhi-Wei Sun, <a href="/A230138/b230138.txt">Table of n, a(n) for n = 1..10000</a>
%e A230138 a(1) = 5 since neither 2 + 2 nor 2*3 - 5 is prime, but 5 + 2 = 7 and 2*5 - 5 = 5 are both prime.
%t A230138 PQ[p_]:=PQ[p]=PrimeQ[p+2]&&PrimeQ[2p-5]
%t A230138 m=0
%t A230138 Do[If[PQ[Prime[n]],m=m+1;Print[m," ",Prime[n]]],{n,1,584}]
%o A230138 (PARI) is_A230138(p)=isprime(p)&&isprime(p+2)&&isprime(p*2-5) \\ For large p it might be much faster to check first whether p%6==5. - _M. F. Hasler_, Oct 10 2013
%Y A230138 Cf. A001359, A006512, A005384, A230140, A230141.
%K A230138 nonn
%O A230138 1,1
%A A230138 _Zhi-Wei Sun_, Oct 10 2013