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 A036993 #17 Mar 04 2020 22:46:26 %S A036993 0,4,8,16,20,24,32,36,40,48,64,68,72,80,84,88,96,100,104,112,128,132, %T A036993 136,144,148,152,160,164,168,176,192,196,200,208,224,256,260,264,272, %U A036993 276,280,288,292,296,304,320,324,328,336,340,344,352,356,360,368,384 %N A036993 Numbers n with property that reading from right to left in the binary expansion of n, the number of 0's always stays ahead of the number of 1's. %H A036993 Reinhard Zumkeller, <a href="/A036993/b036993.txt">Table of n, a(n) for n = 1..1000</a> %H A036993 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %t A036993 Select[Range[0,400],Min[Accumulate[Reverse[IntegerDigits[#,2]]/.{0->1, 1->-1}]]>0&] (* _Harvey P. Dale_, Aug 25 2013 *) %o A036993 (Haskell) %o A036993 a036993 n = a036993_list !! (n-1) %o A036993 a036993_list = filter ((p 0) . a030308_row) [0..] where %o A036993 p _ [] = True %o A036993 p zeros (0:bs) = p (zeros + 1) bs %o A036993 p zeros (1:bs) = zeros > 1 && p (zeros - 1) bs %o A036993 -- _Reinhard Zumkeller_, Jul 31 2013 %Y A036993 Cf. A036990, A036991, A036992, A036994. %Y A036993 Cf. A030308. %K A036993 nonn,easy,base,nice %O A036993 1,2 %A A036993 _N. J. A. Sloane_ %E A036993 More terms from _Erich Friedman_