Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

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

    Home / Get Math Help

    Thue-Morse Sequence

    Sequence description

    sum of binary digit representation of n, mod 2

    Sequence terms

    0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, ...

    Alternate description

    repeatedly apply the replacement rule {0->01, 1->10} on 0

    Program

    a_n = Mod[Total[IntegerDigits[n, 2]], 2]

    Table program

    Table[Mod[Total[IntegerDigits[k, 2]], 2], {k, 0, n}]

    Plot

    Plot

    Back to List | POWERED BY THE WOLFRAM LANGUAGE