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!)
 A214330 a(n) = A214551(n) mod 2. 4
 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 (list; graph; refs; listen; history; text; internal format)
 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 * A266591 A132194 A174897 Adjacent sequences:  A214327 A214328 A214329 * A214331 A214332 A214333 KEYWORD nonn AUTHOR N. J. A. Sloane, Jul 26 2012 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.

Last modified May 25 20:58 EDT 2020. Contains 334597 sequences. (Running on oeis4.)