Another version of the Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 1 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.
A010059
Another version of the Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 1 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =1a(6) =1a(7) =0a(8) =0a(9) =1a(10) =1a(11) =0a(12) =1a(13) =0a(14) =0a(15) =1a(16) =0a(17) =1a(18) =1a(19) =0a(20) =1a(21) =0a(22) =0a(23) =1a(24) =1a(25) =0a(26) =0a(27) =1a(28) =0a(29) =1
External references
- oeis: A010059