This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A289242 Fixed point of the mapping 00->0010, 01->100, 10->100, starting with 00. 3
 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Conjecture: the number of letters (0s and 1s) in the n-th iterate of the mapping is given by A289004. LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 EXAMPLE The first six iterates of the mapping: 00 0010 0010100 00101001000 001010010010000100 0010100100100001010000101000010 MATHEMATICA z = 11; (* number of iterates *) s = {0, 0}; w[0] = StringJoin[Map[ToString, s]]; w[n_] := StringReplace[w[n - 1], {"00" -> "0010", "01" -> "100", "10" -> "100"}] TableForm[Table[w[n], {n, 0, 10}]] st = ToCharacterCode[w[z]] - 48   (* A289242 *) Flatten[Position[st, 0]]  (* A289243 *) Flatten[Position[st, 1]]  (* A289244 *) Table[StringLength[w[n]], {n, 0, 20}] (* A289004 *) CROSSREFS Cf. A289243, A289244, A289004. Sequence in context: A289071 A287931 A289074 * A188037 A144598 A144606 Adjacent sequences:  A289239 A289240 A289241 * A289243 A289244 A289245 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 01 2017 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 April 26 08:53 EDT 2019. Contains 322472 sequences. (Running on oeis4.)