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 A352575 #23 Apr 11 2022 17:30:57
%S A352575 1,10,100,11,1000,101,1010,10000,110,1001,10010,1100,10001,1110,
%T A352575 100000,111,11000,100001,10100,1011,100100,10011,101000,10101,100010,
%U A352575 1101,110000,1111,1000000,10110,101001,1000010,11001,100110,1000001,11010,100101,1001000,10111,1100000,11011,1000100,100011,11100,1000011,101100,1010000,100111,1011000,10000000
%N A352575 A109812(n) in binary.
%H A352575 Michael De Vlieger, <a href="/A352575/b352575.txt">Table of n, a(n) for n = 1..16384</a>
%H A352575 Michael De Vlieger, <a href="/A352575/a352575.png">Bitmap of a(n)</a>, n = 1..2^14, horizontally exaggerating each row by 256X.
%H A352575 N. J. A. Sloane, <a href="/A352575/a352575.txt">Right-justified table of n, a(n) for n = 1..20000</a> [Note this is not a b-file.]
%H A352575 N. J. A. Sloane, <a href="/A352575/a352575-1M.txt.gz">Right-justified table of n, a(n) for n = 1..10^6</a> [gzipped file, copied from A352575] [This file was corrupted, but today I replaced it with a corrected version. - _N. J. A. Sloane_, Apr 11 2022]
%t A352575 nn = 50, c[_] = 0; a[1] = c[1] = 1; u = 2; Do[If[a[i - 1] == u, While[c[u] > 0, u++]]; k = u; While[Nand[c[k] == 0, BitAnd[a[i - 1], k] == 0], k++]; Set[{a[i], c[k]}, {k, i}], {i, Length[s] + 1, nn}]; Array[FromDigits@ IntegerDigits[a[#], 2] &, nn] (* _Michael De Vlieger_, Apr 05 2022 *)
%Y A352575 Cf. A109812, A352576, A352884.
%K A352575 nonn
%O A352575 1,2
%A A352575 _N. J. A. Sloane_, Apr 04 2022