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 A360535 #20 Feb 11 2023 02:31:32
%S A360535 1,2,3,4,3,4,5,6,7,6,7,8,7,8,9,10,9,10,9,8,7,8,9,10,11,10,11,12,11,12,
%T A360535 13,14,15,14,15,16,17,16,15,14,15,14,15,16,15,16,17,18,17,18,17,16,15,
%U A360535 16,17,18,19,18,19,20,19,20,21,22,21,22,21,20,19,20
%N A360535 Analog of Rudin-Shapiro sum sequence A020986, based on counting patterns 00 instead of 11.
%C A360535 a(n) = Sum_{i=0..n} (-1)^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 A020986, 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 A360535 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.
%e A360535 For n = 4, a(n) = 1+1+1+1+(-1) = 3.
%Y A360535 Cf. A020985, A020990, A360536.
%K A360535 nonn
%O A360535 0,2
%A A360535 _Jeffrey Shallit_, Feb 10 2023