RudinShapiro

RudinShapiro[n]

gives the n^(th) term in the RudinShapiro sequence.

Details

  • 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.

Examples

open allclose all

Basic Examples  (2)

The sixth element of the RudinShapiro sequence:

In[1]:=
Click for copyable input
Out[1]=

The number 6 has an odd number of 11 sequences in its binary form:

In[2]:=
Click for copyable input
Out[2]//BaseForm=

The first ten elements of the sequence:

In[1]:=
Click for copyable input
Out[1]=

Display the values alongside the binary expansion:

In[2]:=
Click for copyable input
Out[2]=

Scope  (2)

Applications  (2)

Properties & Relations  (3)

Neat Examples  (1)

See Also

ThueMorse  IntegerDigits  SequenceCount  SubstitutionSystem  FindSequenceFunction

Introduced in 2015
(10.2)