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 A036988 #19 Mar 04 2020 22:59:22
%S A036988 1,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,
%T A036988 1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,
%U A036988 1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,0,0,0,1
%N A036988 Has simplest possible tree complexity of all transcendental sequences.
%H A036988 Reinhard Zumkeller, <a href="/A036988/b036988.txt">Table of n, a(n) for n = 0..1000</a>
%H A036988 H. Niederreiter and M. Vielhaber, <a href="http://dx.doi.org/10.1006/jcom.1996.0014">Tree complexity and a doubly exponential gap between structured and random sequences</a>, J. Complexity, 12 (1996), 187-198.
%F A036988 a(n) = 1 iff, in the binary expansion of n, reading from right to left, the number of 1's never exceeds the number of 0's.
%F A036988 a(n) = A063524(A036989(n)). - _Reinhard Zumkeller_, Jul 31 2013
%t A036988 (* b = A036989 *) b[0] = 1; b[n_?EvenQ] := b[n] = Max[b[n/2] - 1, 1]; b[n_] := b[n] = b[(n-1)/2] + 1; a[n_] := Boole[b[n] == 1]; Table[a[n], {n, 0, 104}] (* _Jean-François Alcover_, Nov 05 2013, after _Reinhard Zumkeller_ *)
%o A036988 (Haskell)
%o A036988 a036988 = a063524 . a036989 -- _Reinhard Zumkeller_, Jul 31 2013
%Y A036988 Cf. A036989. Characteristic function of A036990.
%K A036988 nonn,easy,nice
%O A036988 0,1
%A A036988 _N. J. A. Sloane_
%E A036988 More terms from Larry Reeves (larryr(AT)acm.org), Sep 25 2000