|
Search: id:A068053
|
|
|
| A068053 |
|
Start with one 1 in the infinite vector of zeros, shift one right or left and sum mod 2 (bitwise-XOR) to get 11, then shift two steps and XOR to get 1111, then three steps and XOR to get 1110111, then four steps and so on. |
|
+0
3
|
|
| 1, 11, 1111, 1110111, 11100000111, 1110011111100111, 1110010001111000100111, 11100101101100000110110100111, 1110010101010101110111010101010100111, 1110010100100111011101111011101110010010100111
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
