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 A096787 #10 Mar 06 2019 10:52:47
%S A096787 19,31,43,67,71,79,103,127,131,139,151,163,191,199,211,223,239,251,
%T A096787 271,283,307,311,331,367,379,419,431,439,443,463,487,491,499,523,547,
%U A096787 571,599,607,619,631,643,647,659,683,691,727,739,743,751,787,811,823,827
%N A096787 Primes of form 4n+3 that are the sum of two consecutive composite numbers.
%H A096787 Harvey P. Dale, <a href="/A096787/b096787.txt">Table of n, a(n) for n = 1..1000</a>
%F A096787 Equals 1+2*A096788.
%t A096787 2Select[ Range[ 450], PrimeQ[ # ] == PrimeQ[ # + 1] == False && PrimeQ[2# + 1, GaussianIntegers -> True] == True &] + 1 (* _Robert G. Wilson v_, Jul 11 2004 *)
%t A096787 Select[Total/@Partition[Select[Range[500],CompositeQ],2,1],PrimeQ[#] && IntegerQ[ (#-3)/4]&] (* _Harvey P. Dale_, Mar 06 2019 *)
%o A096787 (PARI) nextcomposite(k)=if(k<3,4,if(isprime(k),k+1,k));
%o A096787 {m=440;n=4;while(n<m,k=nextcomposite(n+1);p=n+k;if(isprime(p)&&(p%4)==3,print1(p,","));n=k)} \\ _Klaus Brockhaus_, Jul 10 2004
%Y A096787 Subsequence of A060254. See A096788 for values 2n+1. See A096676 for n values.
%Y A096787 Cf. A060254, A096784, A096785, A096786, A096788, A096676, A096679.
%K A096787 nonn
%O A096787 1,1
%A A096787 _Lekraj Beedassy_, Jul 09 2004
%E A096787 Corrected and extended by _Klaus Brockhaus_ and _Ray Chandler_, Jul 10 2004