The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A288462 Fixed point of the mapping 00->0101, 1->10, starting with 00. 4
 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Conjecture: the number of letters (0's and 1's) in the n-th iterate is given by A288465(n). LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 EXAMPLE Iterates, starting with 00: 00 0101 010010 0100101100 010010110010100101 01001011001010010110010010110010 MATHEMATICA s = {0, 0}; w[0] = StringJoin[Map[ToString, s]]; w[n_] := StringReplace[w[n - 1], {"00" -> "0101", "1" -> "10"}] Table[w[n], {n, 0, 8}] st = ToCharacterCode[w[11]] - 48   (* A288462 *) Flatten[Position[st, 0]]  (* A288463 *) Flatten[Position[st, 1]]  (* A288464 *) Table[StringLength[w[n]], {n, 1, 35}] (* A288465 conjectured *) CROSSREFS Cf. A288463, A288464, A288465. Sequence in context: A111748 A282244 A286691 * A130198 A285411 A104893 Adjacent sequences:  A288459 A288460 A288461 * A288463 A288464 A288465 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jun 11 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 17 23:07 EDT 2022. Contains 353779 sequences. (Running on oeis4.)