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 A135133 #14 Feb 11 2019 01:27:07
%S A135133 0,0,0,0,0,0,0,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,1,1,0,1,1,1,1,1,1,1,0,0,
%T A135133 0,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,
%U A135133 0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1,1
%N A135133 a(n) = floor(S2(n)/3) mod 2, where S2(n) denotes the binary weight of n.
%C A135133 A generalized Thue-Morse sequence.
%H A135133 Nathaniel Johnston, <a href="/A135133/b135133.txt">Table of n, a(n) for n = 0..10000</a>
%H A135133 Ricardo Astudillo, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL6/Astudillo/astudillo12.html">On a class of Thue-Morse type sequences</a>, Journal of Integer Sequences, Vol. 6 (2003), Article 03.4.2.
%p A135133 S2 := proc(n) return add(d, d=convert(n,base,2)): end: A135133 := proc(n) return floor(S2(n)/3) mod 2: end: seq(A135133(n),n=0..104); # _Nathaniel Johnston_, May 06 2011
%t A135133 Table[Mod[Floor[(Plus @@ IntegerDigits[n, 2])/3], 2], {n, 0, 50}] (* _G. C. Greubel_, Sep 28 2016 *)
%Y A135133 Cf. A000120, A010060.
%K A135133 nonn,base,easy
%O A135133 0,1
%A A135133 _Ctibor O. Zizka_, Feb 12 2008