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 A360536 #11 Feb 11 2023 02:31:19
%S A360536 1,0,1,0,-1,-2,-1,-2,-1,0,1,0,-1,-2,-1,-2,-3,-4,-5,-4,-5,-6,-5,-6,-5,
%T A360536 -4,-3,-4,-5,-6,-5,-6,-5,-4,-3,-4,-3,-2,-3,-2,-1,0,1,0,-1,-2,-1,-2,-3,
%U A360536 -4,-5,-4,-5,-6,-5,-6,-5,-4,-3,-4,-5,-6,-5,-6,-7,-8,-9
%N A360536 Analog of Rudin-Shapiro sum sequence A020990, based on counting patterns 00 instead of 11.
%C A360536 a(n) = Sum_{i=0..n} (-1)^(i+e(i)), where e(i) counts the (possibly overlapping) occurrences of 00 in the base-2 representation of n. Note that e(0) = 0. This is the analog of A020990, which is the same sum, but with e(n) replaced by the function that counts the (possibly overlapping) occurrences of 11 in the base-2 representation of n.
%H A360536 N. Rampersad and J. Shallit, <a href="https://arxiv.org/abs/2302.00405">Rudin-Shapiro sums via automata theory and logic</a>, Arxiv preprint arXiv:2302.00405 [math.NT], February 1 2023.
%Y A360536 Cf. A020985, A020990, A360535.
%K A360536 sign
%O A360536 0,6
%A A360536 _Jeffrey Shallit_, Feb 10 2023