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 A092436 #25 Mar 04 2023 02:07:38
%S A092436 0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,1,1,
%T A092436 0,1,0,0,1,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,0,1,
%U A092436 0,0,1,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,1
%N A092436 a(n) = 1/2 + (-1)^n*(1/2 - A010060(floor(n/2))).
%C A092436 From _Jeffrey Shallit_, Mar 02 2022: (Start)
%C A092436 Also, the parity of the number of 2's in the bijective base-2 representation of n - 1; this is the base-2 representation using the digits {1,2} in place of {0,1}.
%C A092436 Also, solution of the equation a = 0 mu(a), where mu is the Thue-Morse morphism 0 -> 01, 1 -> 10. (End)
%H A092436 Michael De Vlieger, <a href="/A092436/b092436.txt">Table of n, a(n) for n = 1..10000</a>
%F A092436 a(n) = 1-A010060(n). - _Chai Wah Wu_, Mar 03 2023
%t A092436 Flatten[ NestList[ Function[l, {Flatten[(l /. {0 -> {0, 1}, 1 -> {1, 0}})]}], {0}, 6]] (* _Robert G. Wilson v_, May 19 2005 *)
%o A092436 (Python)
%o A092436 def A092436(n): return n.bit_count()&1^1 # _Chai Wah Wu_, Mar 03 2023
%Y A092436 Cf. A027914, A010060.
%K A092436 nonn
%O A092436 1,1
%A A092436 _Benoit Cloitre_, Mar 23 2004