gives the n term in the Rudin–Shapiro sequence.
- RudinShapiro[n] is 1 if n has an even number of possibly overlapping 11 sequences in its base-2 digits, and is -1 otherwise.
- RudinShapiro automatically threads over lists.
Basic Examples (2)
The sixth element of the Rudin–Shapiro sequence:
The number 6 has an odd number of 11 sequences in its binary form:
The first ten elements of the sequence:
Display the values alongside the binary expansion:
Properties & Relations (3)
Introduced in 2015