This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286059 Fixed point of the mapping 00->001, 1->011, starting with 00. 4
 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1 (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 A286062. LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 EXAMPLE Iterates, starting with 00: 00 001 001011 0010110011011 00101100110110010110110011011 MATHEMATICA s = {0, 0}; w[0] = StringJoin[Map[ToString, s]]; w[n_] := StringReplace[w[n - 1], {"00" -> "001", "1" -> "011"}] Table[w[n], {n, 0, 8}] st = ToCharacterCode[w[11]] - 48   (* A286059 *) Flatten[Position[st, 0]]  (* A286060 *) Flatten[Position[st, 1]]  (* A286061 *) Table[StringLength[w[n]], {n, 1, 35}] (* A286062 conjectured *) CROSSREFS Cf. A286060, A286061, A286062. Sequence in context: A092436 A288306 A164056 * A163539 A143538 A242018 Adjacent sequences:  A286056 A286057 A286058 * A286060 A286061 A286062 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jun 05 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 October 17 22:05 EDT 2019. Contains 328134 sequences. (Running on oeis4.)