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.

1, 11, 1111, 1110111, 11100000111, 1110011111100111, 1110010001111000100111, 11100101101100000110110100111, 1110010101010101110111010101010100111, 1110010100100111011101111011101110010010100111

Offset: 0

Author

Antti Karttunen, Feb 13 2002

Keywords

• nonn
• base

Links

• Paolo Xausa, Table of n, a(n) for n = 0..44

Crossrefs

Sequence A068052 converted to binary. Rows of A053632 reduced mod 2 and concatenated.

Programs

Maple

map(convert, A068052,binary);

Mathematica

Map[FromDigits[IntegerDigits[#, 2]] &, FoldList[BitXor[#, #*#2] &, 1, 2^Range[10]]] (* Paolo Xausa, Mar 07 2024 *)