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 A223888 #17 Nov 13 2019 10:11:31
%S A223888 25,69,81,87,115,145,213,265,289,339,355,391,415,445,477,493,505,529,
%T A223888 565,695,731,747,789,815,841,901,985,1041,1047,1077,1119,1149,1207,
%U A223888 1219,1315,1341,1347,1383,1401,1411,1437,1465,1509,1513,1527,1537,1555,1585
%N A223888 Composite odious numbers (A000069) having no proper odious divisors greater than 1.
%C A223888 The sequence is obtained using Eratosthenes-like sieve for odious numbers.
%H A223888 Amiram Eldar, <a href="/A223888/b223888.txt">Table of n, a(n) for n = 1..10000</a>
%t A223888 odiousQ[n_] := OddQ@Total@IntegerDigits[n, 2]; okQ[n_] := n > 1 && odiousQ[n] && ! PrimeQ[n] && Catch[Do[If[odiousQ[d], Throw[False]], {d, Most@Rest@Divisors@n}]; True]; Select[Range@3000, okQ] (* _Giovanni Resta_, Mar 28 2013 *)
%o A223888 (PARI) isodi(n) = hammingweight(n) % 2;
%o A223888 noodid(n) = {fordiv(n, d, if ((d != 1) && (d < n) && isodi(d), return (0));); 1;}
%o A223888 lista(nn) = {forcomposite(n=1, nn, if (isodi(n) && noodid(n), print1(n, ", ")););} \\ _Michel Marcus_, Feb 08 2016
%Y A223888 Cf. A000069, A001969, A217790.
%K A223888 nonn,base
%O A223888 1,1
%A A223888 _Vladimir Shevelev_, Mar 28 2013
%E A223888 a(10)-a(48) from _Giovanni Resta_, Mar 28 2013