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 A236458 #15 Apr 12 2014 13:15:24
%S A236458 3,5,17,41,1949,2309,2711,2789,2801,3299,3329,3359,3917,4157,4217,
%T A236458 4259,4637,5009,5021,5231,6449,7757,8087,8219,8627,9419,9929,10007,
%U A236458 10937,11777,12071,14321,15647,15971,16061,16901,18131,18251,18287,18539
%N A236458 Primes p with p + 2 and prime(p) + 2 both prime.
%C A236458 According to the conjecture in A236470, the sequence should have infinitely many terms. This is stronger than the twin prime conjecture.
%C A236458 See A236457 and A236467 for similar sequences.
%H A236458 Zhi-Wei Sun, <a href="/A236458/b236458.txt">Table of n, a(n) for n = 1..10000</a>
%e A236458 a(1) = 3 since 3 + 2 = 5 and prime(3) + 2 = 7 are both prime, but 2 + 2 = 4 is composite.
%t A236458 p[n_]:=PrimeQ[n+2]&&PrimeQ[Prime[n]+2]
%t A236458 n=0;Do[If[p[Prime[m]],n=n+1;Print[n," ",Prime[m]]],{m,1,10000}]
%o A236458 (PARI) s=[]; forprime(p=2, 20000, if(isprime(p+2) && isprime(prime(p)+2), s=concat(s, p))); s \\ _Colin Barker_, Jan 26 2014
%Y A236458 Cf. A000040, A001359, A006512, A236119, A236456, A236457, A236467, A236470.
%K A236458 nonn
%O A236458 1,1
%A A236458 _Zhi-Wei Sun_, Jan 26 2014