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,2

Links

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

Maple

map(convert, A068052, binary);

Mathematica

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

Crossrefs

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

Sequence in context: A099814 A340549 A260077 * A136308 A343837 A303067

Adjacent sequences: A068050 A068051 A068052 * A068054 A068055 A068056

Keyword

nonn,base

Author

Antti Karttunen, Feb 13 2002

Status

approved