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 A330289 #15 Dec 11 2019 05:05:27
%S A330289 1,2,4,8,16,28,56,112,224,448,728,1456,2912,5824,10192,11648,20384,
%T A330289 27664,40768,55328,110656,221312,442624,885248,1263808,1770496,
%U A330289 2527616,5055232,8077888,10110464,16155776,20220928,32311552,64623104,129246208,258492416,516984832
%N A330289 Numbers all of whose divisors are odious numbers (A000069) with a record number of divisors.
%C A330289 A number m is in this sequence if it is in A093696, and d(m) > d(k) for all terms k < m in A093696, where d(m) is the number of divisors of m (A000005).
%C A330289 The corresponding record numbers of divisors are 1, 2, 3, 4, 5, 6, 8, 10, 12, 14, 16, 20, ... (see the link for more values).
%H A330289 Amiram Eldar, <a href="/A330289/b330289.txt">Table of n, a(n) for n = 1..43</a>
%H A330289 Amiram Eldar, <a href="/A330289/a330289.txt">Table of n, a(n), A000005(a(n)) for n = 1..43</a>
%e A330289 The first 5 terms of A093696 are 1, 2, 4, 7, 8 and their numbers of divisors are 1, 2, 3, 2, 4. The record values 1, 2, 3, and 4 are reached at 1, 2, 4 and 8 that are the first 4 terms of this sequence.
%t A330289 odiousQ[n_] := OddQ @ DigitCount[n, 2][[1]]; allDivOdiousQ[n_] := AllTrue[ Divisors[n], odiousQ]; divNumMax = 0; seq={}; Do[If[allDivOdiousQ[n] && (divNum = DivisorSigma[0, n]) > divNumMax, divNumMax = divNum; AppendTo[seq, n]], {n, 1, 3000}]; seq
%Y A330289 Subsequence of A000069 and A093696.
%Y A330289 Cf. A000005.
%K A330289 nonn,base
%O A330289 1,2
%A A330289 _Amiram Eldar_, Dec 09 2019