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 A269662 #14 Sep 08 2022 08:46:15
%S A269662 9,25,85,121,145,205,217,301,361,481,565,697,841,865,1141,1285,1717,
%T A269662 1765,2041,2101,2305,2461,2581,2605,2641,2965,2977,3241,3337,3397,
%U A269662 3865,3901,3997,4285,4537,4681,4765,5317,5377,5461,5941,6001,6241,6505,6937,7081,7117
%N A269662 Semiprimes which are the sum of a twin prime pair plus one.
%C A269662 All the terms, except a(1), are congruent to 1 (mod 3).
%H A269662 K. D. Bajpai, <a href="/A269662/b269662.txt">Table of n, a(n) for n = 1..10000</a>
%e A269662 a(2) = 25 = 5 * 5 that is semiprime. Also, 25 = 11 + 13 + 1 where {11, 13} is a twin prime pair.
%e A269662 a(3) = 85 = 5 * 17 that is semiprime. Also, 55 = 41 + 43 + 1 where {41, 43} is a twin prime pair.
%t A269662 A269662 = {}; Do[a = Prime[n]; b = a + 2; c = a + b + 1; If[PrimeQ[b] && PrimeOmega[c] == 2, AppendTo[A269662, c]], {n, 1000}]; A269662
%t A269662 Select[Range[1, 7200, 2], And[PrimeOmega@ # == 2, And[PrimeQ@ #, NextPrime[#] - 2] == # &[(# - 1)/2 - 1]] &] (* _Michael De Vlieger_, Apr 01 2016 *)
%t A269662 Select[1+Total[#]&/@Select[Partition[Prime[Range[500]],2,1],#[[2]]-#[[1]] == 2&],PrimeOmega[#]==2&] (* _Harvey P. Dale_, Apr 10 2016 *)
%o A269662 (PARI) for(n = 1, 1000, p=prime(n); q=p+2; s=p+q+1; if(isprime(q) && bigomega(s)==2, print1(s,", ")));
%o A269662 (Magma) IsP2:=func< n | &+[k[2]: k in Factorization(n)] eq 2 >; [ s: n in [1..1000] | IsPrime(n) and IsPrime(n+2) and IsP2(s) where s is (n + n+2 + 1)];
%Y A269662 Cf. A001097, A001358, A001359, A006512, A054735, A118071.
%K A269662 nonn
%O A269662 1,1
%A A269662 _K. D. Bajpai_, Mar 02 2016