Wolfram Language & System 10.4 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)

RudinShapiro

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

DetailsDetails

  • RudinShapiro[n] is if n has an even number of possibly overlapping sequences in its base-2 digits, and is otherwise.
  • RudinShapiro automatically threads over lists.

ExamplesExamplesopen allclose all

Basic Examples  (2)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 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]=
Introduced in 2015
(10.2)