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 A261080 #11 Jan 29 2016 16:27:11
%S A261080 6,35,323,437,899,1763,2021,4757,9797,10403,19043,22499,27221,38021,
%T A261080 39203,72899,79523,95477,99221,131753,145157,154433,164009,205193,
%U A261080 210677,213443,250997,272483,324899,381923,412163,416021,455621,549077,557993,594437,656099,675683,736163,741317,777923,783221,826277,870473,881717,974153,1022117,1102499,1127843,1238753
%N A261080 Semiprimes p*q for which p and q are successive primes and their binary representations differ from each other in one bit position only.
%C A261080 Numbers n for which A260737(n) = A261079(n) = 1.
%H A261080 Harvey P. Dale, <a href="/A261080/b261080.txt">Table of n, a(n) for n = 1..1000</a>
%F A261080 a(n) = A205511(n) * A205302(n).
%e A261080 6 is included as 6 = 2*3, 2 and 3 are successive primes, and 2 (in binary "10") and 3 (in binary "11") differ by only one bit from each other.
%t A261080 brdQ[{a_,b_}]:=Module[{c=IntegerDigits[a,2],d=IntegerDigits[b,2]}, Length[ c] == Length[d]&&Count[Total/@Transpose[{c,d}],1]==1]; Times@@@ Select[ Partition[Prime[Range[200]],2,1],brdQ] (* _Harvey P. Dale_, Jan 29 2016 *)
%o A261080 (Scheme, two variants, the other one requiring _Antti Karttunen_'s IntSeq-library)
%o A261080 (define (A261080 n) (* (A205302 n) (A205511 n)))
%o A261080 (define A261080 (MATCHING-POS 1 1 (lambda (n) (and (= 1 (A260737 n)) (= 1 (A261079 n))))))
%Y A261080 Cf. A205302, A205511, A260737, A261079.
%Y A261080 Intersection of A006094 and A261077.
%K A261080 nonn
%O A261080 1,1
%A A261080 _Antti Karttunen_, Sep 23 2015