The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2

%I

%S 1,11,1111,1110111,11100000111,1110011111100111,

%T 1110010001111000100111,11100101101100000110110100111,

%U 1110010101010101110111010101010100111,1110010100100111011101111011101110010010100111

%N 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.

%p map(convert, A068052,binary);

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

%K nonn,base

%O 0,2

%A _Antti Karttunen_, Feb 13 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 20:25 EDT 2021. Contains 345009 sequences. (Running on oeis4.)