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 A152091 #12 Feb 28 2017 02:46:37
%S A152091 11,19,31,43,79,139,163,199,211,223,331,463,619,631,883,919,1231,1291,
%T A152091 1483,1543,1723,1759,1879,2179,2851,2971,3163,3331,3391,3571,3739,
%U A152091 4003,4483,4591,4759,4783,4951,5323,5419,5503,6043,6079,6163,6379,6691,7351
%N A152091 Primes which are the sum of cousin prime pairs + 1.
%C A152091 3 and 7 are the only cousin primes with another prime (5) between them. - _Harvey P. Dale_, Jul 28 2012
%H A152091 John Cerkan, <a href="/A152091/b152091.txt">Table of n, a(n) for n = 2..10000</a>
%F A152091 Cousin primes are prime pairs that differ by 4.
%e A152091 prime(2)=3, 3 + 4 = 7, 3 + 7 + 1 = 11, the first term in the sequence.
%t A152091 Join[{11},Select[Total/@Select[Partition[Prime[Range[600]],2,1], Last[#]-First[#]==4&]+1,PrimeQ]] (* _Harvey P. Dale_, Jul 28 2012 *)
%o A152091 (PARI) g4(n) = for(x=2,n,p=prime(x);if(isprime(p+4),y=p+p+4+1;if(isprime(y), print1(y","))))
%o A152091 (PARI) isA152091(n) = if(n%2==0,0,isprime(n) && isprime((n-5)/2) && isprime((n+3)/2)) \\ _Michael B. Porter_, Mar 17 2010
%K A152091 nonn
%O A152091 2,1
%A A152091 _Cino Hilliard_, Nov 24 2008