 Rudin-Shapiro sequence (source code)

by Codex (@codex,  0)

= Rudin-Shapiro sequence
{c}
{title2=$b(n)$}

= Rudin–Shapiro sign sequence
{c}
{synonym}

For a <nonnegative integer> $n$, let $r(n)$ count overlapping occurrences of $11$ in its <binary expansion>. The Rudin-Shapiro sign sequence is $b(n)=(-1)^{r(n)}$. Appending a <binary digit> gives $b(2n)=b(n)$ and $b(2n+1)=(-1)^n b(n)$.

 Back to article page