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 A152295 #4 Jul 29 2014 13:04:29
%S A152295 17,71,83,107,191,227,251,263,431,443,479,503,587,827,839,911,983,
%T A152295 1091,1151,1163,1187,1619,1667,1847,1907,2087,2243,2459,2591,3023,
%U A152295 3467,4463,4871,4943,5471,5519,5651,5807,5903,6131,6203,6299,6311,6563,6983,7127
%N A152295 Primes of the form : (p-n)/(n+1)=prime and (n+1)*p+n=prime. n=5.
%C A152295 This is the general form : (p-n)/(n+1)=primeand(n+1)*p+n=prime; 'Safe' primes and'Sophie Germain' primes just one part of this general form; If n=1 then we got'Safe' primes and'Sophie Germain' primes.
%H A152295 Harvey P. Dale, <a href="/A152295/b152295.txt">Table of n, a(n) for n = 1..3000</a>
%t A152295 lst={};n=5;Do[p=Prime[k];If[PrimeQ[(p-n)/(n+1)]&&PrimeQ[(n+1)*p+n],AppendTo[lst,p]],{k,7!}];lst
%t A152295 Select[Prime[Range[1000]],AllTrue[{(#-5)/6,6#+5},PrimeQ]&] (* This program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Jul 29 2014 *)
%Y A152295 Cf. A059455, A152292, A152293, A152294
%K A152295 nonn
%O A152295 1,1
%A A152295 _Vladimir Joseph Stephan Orlovsky_, Dec 02 2008