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 A158476 #8 Apr 06 2023 08:30:32
%S A158476 107,71549,97379,103067,136709,342449,403829,686969,695879,758267,
%T A158476 795797,805499,887399,941489,945881,1023227,1025747,1081709,1081979,
%U A158476 1169027,1179989,1261259,1456919,1554101,2110877,2148659,2167469,2433059,2494439,2554397,2623571,2803121
%N A158476 Lesser of twin pairs in A086006.
%C A158476 Primes p such that both p and p+2 are terms in A086006.
%H A158476 Amiram Eldar, <a href="/A158476/b158476.txt">Table of n, a(n) for n = 1..10000</a>
%H A158476 Zak Seidov, <a href="http://zak08.livejournal.com/7613.html">First 100 terms</a>.
%t A158476 Select[Prime[Range[10^6]], PrimeQ[# + 2] && PrimeOmega[2*# - 1] == PrimeOmega[2*# + 1] == 2 && PrimeOmega[2*# + 3] == PrimeOmega[2*# + 5] == 2 &] (* _Amiram Eldar_, Apr 06 2023 *)
%o A158476 (PARI) is(p) = (bigomega(2*p+1) == 2) && (bigomega(2*p-1) == 2);
%o A158476 lista(max) = {my(q1 = 0, q2, prev = 0); forprime(p = 2, max, q2 = is(p); if(p == prev + 2 && q1 && q2, print1(prev, ", ")); prev = p; q1 = q2);} \\ _Amiram Eldar_, Apr 06 2023
%Y A158476 Cf. A086005, A086006.
%K A158476 nonn
%O A158476 1,1
%A A158476 _Zak Seidov_, Mar 20 2009
%E A158476 More terms from _Amiram Eldar_, Apr 06 2023