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 A236484 #9 Jan 27 2014 02:52:47
%S A236484 2371709,3406727,8890667,45809639,57219497,58674437,73793831,78934589,
%T A236484 159935561,207223409
%N A236484 Primes p with p + 2, prime(p) + 2, prime(prime(p)) + 2, prime(prime(prime(p))) + 2, prime(prime(prime(prime(p)))) + 2 all prime.
%C A236484 By the general conjecture in A236481, this sequence should have infinitely many terms.
%H A236484 Zhi-Wei Sun, <a href="/A236484/b236484.txt">Table of n, a(n) for n = 1..10</a>
%e A236484 a(1) = 2371709 with 2371709, 2371709 + 2 = 2371711, prime(2371709) + 2 = 38917889 + 2 = 38917891, prime(38917889) + 2 = 754394519 + 2 = 754394521, prime(754394519) + 2 = 16978533527 + 2 = 16978533529 and prime(16978533527) + 2 = 437397516929 + 2 = 437397516931 all prime.
%t A236484 p[n_]:=p[n]=PrimeQ[n+2]&&PrimeQ[Prime[n]+2]&&PrimeQ[Prime[Prime[n]]+2]&&PrimeQ[Prime[Prime[Prime[n]]]+2]&&PrimeQ[Prime[Prime[Prime[Prime[n]]]]+2]
%t A236484 n=0;Do[If[p[Prime[m]],n=n+1;Print[n," ",Prime[m]]],{m,1,10^7}]
%Y A236484 Cf. A000040, A001359, A006512, A236481, A236482.
%K A236484 nonn
%O A236484 1,1
%A A236484 _Zhi-Wei Sun_, Jan 27 2014