A112539 Half-baked Thue-Morse: at successive steps the sequence or its bit-inverted form is appended to itself.

1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0

Offset

1,1

Links

Table of n, a(n) for n=1..105.

Example

1;
0;
1, 0;
0, 1, 0, 1;
1, 0, 1, 0, 0, 1, 0, 1;
0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0;
1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0;
0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0...

Mathematica

s = {1}; Do[s = Join[s, Mod[s + 1, 2]]; s = Join[s, s], {n, 4}]; s (* Robert G. Wilson v, Dec 22 2005 *)

Prog

s=[1 0]; loop s=[s s]; s=[s inv(s)] endloop

Crossrefs

Cf. A112865 (as +-1), A341389 (complement).

Cf. A104104, A010060.

Sequence in context: A320167 A030658 A187950 * A104104 A188467 A039983

Adjacent sequences: A112536 A112537 A112538 * A112540 A112541 A112542

Keyword

easy,nonn

Author

Alexandre Losev, Dec 15 2005

Extensions

More terms from Robert G. Wilson v, Dec 22 2005

Status

approved