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

 

Logo


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
1, 11, 1111, 1110111, 11100000111, 1110011111100111, 1110010001111000100111, 11100101101100000110110100111, 1110010101010101110111010101010100111, 1110010100100111011101111011101110010010100111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..9.

MAPLE

map(convert, A068052, binary);

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

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 07:28 EDT 2021. Contains 343821 sequences. (Running on oeis4.)