A214330 a(n) = A214551(n) mod 2.

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

Offset

0

Links

N. J. A. Sloane, Table of n, a(n) for n = 0..10000

N. J. A. Sloane, State diagram [State diagram for A214551 mod 2 for any three initial terms. Nodes are labeled with a(n-2) a(n-1) a(n), edges are labeled with a(n+1).]

Formula

Consists of an initial string 1110101010, followed by infinitely many strings of the form 0111010(10)* (see state diagram in link). If s denotes the string 0111010, then the sequence begins as follows:

1110101010s10ss10101010ss101010sss10s10s101010s10s101010101010s10101010\

ssss10101010s1010ss10s1010s10101010s1010s10s10sss10101010101010sss10101\

0ss10ss1010101010101010s10s1010101010sss101010s10ss10sss10s10s10101010s\

ss10s10sssss101010s10s10s1010ss1010s1010ss10s1010101010s10s101010s1010s\

...

Crossrefs

Cf. A214551.

Sequence in context: A075439 A267853 A104338 * A335909 A266591 A372553

Adjacent sequences: A214327 A214328 A214329 * A214331 A214332 A214333

Keyword

nonn

Author

N. J. A. Sloane, Jul 26 2012

Status

approved