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 A230226 #22 Sep 23 2019 13:27:49
%S A230226 49,91,121,133,143,217,247,259,273,341,361,385,403,451,475,481,511,
%T A230226 517,539,589,611,625,637,651,665,671,721,737,749,767,775,779,793,803,
%U A230226 805,847,861,871,875,889,925,949,959,961,1001,1015,1027,1029,1053,1057,1067
%N A230226 Odd odious numbers (A000069) which can be written as a product of two odious numbers > 1.
%H A230226 Amiram Eldar, <a href="/A230226/b230226.txt">Table of n, a(n) for n = 1..10000</a>
%e A230226 From _Bernard Schott_, Sep 23 2019: (Start)
%e A230226 49 = 7 * 7 with 7 = 111_2 and 49 = 110001_2 hence 49 is a term.
%e A230226 91 = 7 * 13 with 7 = 111_2, 13 = 1101_2 and 91 = 1011011_2, hence 91 is a term. (End)
%t A230226 odiousQ[n_] := OddQ[DigitCount[n, 2][[1]]]; fQ[n_] := Module[{f, i}, If[PrimeQ[n], False, f = Select[Divisors[n], # > 1 && # <= Sqrt[n] &]; i = 1; While[i <= Length[f] && ! (odiousQ[f[[i]]] && odiousQ[n/f[[i]]]), i++]; i <= Length[f]]]; Select[Range[1, 1000, 2], odiousQ[#] && fQ[#] &] (* _T. D. Noe_, Oct 16 2013 *)
%Y A230226 Cf. A000069, A230213.
%K A230226 nonn,base
%O A230226 1,1
%A A230226 _Vladimir Shevelev_, Oct 12 2013
%E A230226 Extended by _T. D. Noe_, Oct 16 2013