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 A135947 #5 Jan 08 2024 13:58:49
%S A135947 0,1,1,1,1,1,1,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,0,0,0,0,0,0,1,1,1,
%T A135947 1,0,1,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,1,0,1,1,1,1,1,1,0,
%U A135947 1,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0
%N A135947 a(n)=(floor(3*S2(n)/2)) mod 2, where S2(n) is the binary weight of n.
%t A135947 Table[Mod[Floor[(3*Total[IntegerDigits[n,2]])/2],2],{n,0,100}] (* _Harvey P. Dale_, Jan 08 2024 *)
%K A135947 easy,nonn
%O A135947 0,1
%A A135947 _Ctibor O. Zizka_, Mar 02 2008