Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Rudin-Shapiro Sequence

    Sequence description

    -1 raised to the power of the number of 11-blocks in the binary representation of n

    Sequence terms

    1, 1, 1, -1, 1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, -1, ...

    Program

    a_n = (-1)^Count[Partition[IntegerDigits[n, 2], 2, 1], {1, 1}]

    Table program

    Table[(-1)^Count[Partition[IntegerDigits[k, 2], 2, 1], {1, 1}], {k, 0, n}]

    Plot

    Plot

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.