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 A045799 #14 Sep 08 2019 02:51:47 %S A045799 100,10001,10100,11000,100100,1000011,1001001,1001010,1001100,1010010, %T A045799 1011000,1100001,1100100,1101000,1110000,10101010,11001100,11011000, %U A045799 11110000,100000111,100001101,100010101,100010110,100011001,100011100 %N A045799 In the list of divisors of n (in binary), each digit 0-1 appears equally often. %C A045799 The corresponding decimal values of the terms are 4, 17, 20, 24, 36, 67, 73, 74, 76, 82, 88, 97, 100, 104, 112, 170, 204, 216, 240, 263, 269, 277, 278, 281, 284, ... - _Amiram Eldar_, Sep 08 2019 %H A045799 Amiram Eldar, <a href="/A045799/b045799.txt">Table of n, a(n) for n = 1..10000</a> %H A045799 N. Nomoto, <a href="http://www.geocities.co.jp/Technopolis/1793/09digit.htm">In the list of divisors of n,... </a> [Dead link] %e A045799 E.g. divisors of 10100 are (1, 10, 100, 101, 1010, 10100); the numbers of digits (0-1) are [ 0(9),1(9) ]. %t A045799 fQ[v_] := Length[v] == 2 && v[[1]] == v[[2]]; aQ[n_] := fQ[(Tally @ Flatten @ Join @ IntegerDigits[Divisors[n], 2])[[;; , 2]]]; FromDigits /@ IntegerDigits[Select[ Range[284], aQ], 2] (* _Amiram Eldar_, Sep 08 2019 *) %Y A045799 Cf. A038564, A038565, A045810. %K A045799 easy,nonn,base %O A045799 1,1 %A A045799 _Naohiro Nomoto_