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 A236509 #5 Jan 27 2014 08:42:21
%S A236509 5,11,107,227,311,347,821,857,1091,1607,1997,2657,3527,4931,5231,8087,
%T A236509 8231,9431,10331,11171,12917,13691,13877,21377,22271,24917,27737,
%U A236509 29567,32057,33347,35591,36467,37307,39227,42017
%N A236509 Primes p with p + 2, p + 6 and prime(p) + 6 all prime.
%C A236509 According to the conjecture in A236508, this sequence should have infinitely many terms.
%H A236509 Zhi-Wei Sun, <a href="/A236509/b236509.txt">Table of n, a(n) for n = 1..10000</a>
%e A236509 a(1) = 5 since 5, 5 + 2 = 7, 5 + 6 = 11 and prime(5) + 6 = 17 are all prime, but 2 + 2 = 4 and 3 + 6 = 9 are both composite.
%t A236509 p[n_]:=p[n]=PrimeQ[n+2]&&PrimeQ[n+6]&&PrimeQ[Prime[n]+6]
%t A236509 n=0;Do[If[p[Prime[m]],n=n+1;Print[n," ",Prime[m]]],{m,1,10^6}]
%Y A236509 Cf. A000040, A022004, A023201, A046117, A236464, A236508.
%K A236509 nonn
%O A236509 1,1
%A A236509 _Zhi-Wei Sun_, Jan 27 2014