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 A096788 #27 May 07 2025 16:59:07
%S A096788 9,15,21,33,35,39,51,63,65,69,75,81,95,99,105,111,119,125,135,141,153,
%T A096788 155,165,183,189,209,215,219,221,231,243,245,249,261,273,285,299,303,
%U A096788 309,315,321,323,329,341,345,363,369,371,375,393,405,411,413,429,441
%N A096788 Numbers m such that both m and m+1 are composite numbers whose sum is a prime of the form 4k+3.
%C A096788 Odd composite numbers c such that 2*c + 1 is prime. - _Alexandre Herrera_, Jul 07 2023
%F A096788 Equals (A096787 - 1)/2.
%t A096788 Select[ Range[ 450], PrimeQ[ # ] == PrimeQ[ # + 1] == False && PrimeQ[2# + 1, GaussianIntegers -> True] == True &] (* _Robert G. Wilson v_, Jul 11 2004 *)
%o A096788 (PARI) nextcomposite(k)=if(k<3,4,if(isprime(k),k+1,k));
%o A096788 {m=455;n=4;while(n<m,k=nextcomposite(n+1);p=n+k;if(isprime(p)&&(p%4)==3,print1(n,","));n=k)} \\ _Klaus Brockhaus_, Jul 10 2004
%Y A096788 Subsequence (odd numbers) of A096784. See A096787 for the associated primes.
%Y A096788 Cf. A060254, A096784, A096785, A096786, A096787, A096676.
%K A096788 nonn
%O A096788 1,1
%A A096788 _Lekraj Beedassy_, Jul 09 2004
%E A096788 Corrected and extended by _Klaus Brockhaus_ and _Ray Chandler_, Jul 10 2000
%E A096788 Incorrect comment about Gaussian primes deleted by _N. J. A. Sloane_, Mar 02 2011