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!)
 A288622 0-limiting word of the mapping 00->0110, 1->01, starting with 00. 4
 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Iterates, starting with 00: 00 0110 001010 0110010010 001010110010110010 01100100100101011001001010110010 0010101100101100101100100100101011001011001001001010110010 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 MATHEMATICA s = {0, 0}; w[0] = StringJoin[Map[ToString, s]]; w[n_] := StringReplace[w[n - 1], {"00" -> "0110", "1" -> "01"}] Table[w[n], {n, 0, 8}] st = ToCharacterCode[w[10]] - 48   (* A288622 *) Flatten[Position[st, 0]]  (* A288623 *) Flatten[Position[st, 1]]  (* A288624 *) Table[StringLength[w[n]], {n, 1, 35}] (* A288465 conjectured *) CROSSREFS Cf. A288623, A288624, A288465. Sequence in context: A144608 A327208 A178226 * A095907 A056051 A143541 Adjacent sequences:  A288619 A288620 A288621 * A288623 A288624 A288625 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jun 14 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 January 20 19:22 EST 2021. Contains 340332 sequences. (Running on oeis4.)