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!)
 A288736 2-limiting word of the mapping 00->1000, 10->01, starting with 00. 5

%I

%S 0,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,

%T 1,1,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,0,0,0,1,1,0,0,0,0,1,

%U 1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,1,0,1

%N 2-limiting word of the mapping 00->1000, 10->01, starting with 00.

%C Iterates of the mapping, starting with 00:

%C 00

%C 1000

%C 011000

%C 01011000

%C 0011011000

%C 10001011011000

%C 011000011011011000

%C 0101100001011011011000

%C 00110110000011011011011000

%C 1000101101100010001011011011011000

%C The 2-limiting word is the limit of the n-th iterates for n == 2 mod 4. Conjecture: the number of letters (0's and 1's) in the n-th iterate is given by A288732(n), for n >= 0.

%H Clark Kimberling, <a href="/A288736/b288736.txt">Table of n, a(n) for n = 1..10000</a>

%e The first three n-th iterates for n == 2 mod 3 are

%e 011000

%e 011000011011011000

%e 011000011011011000011000011011011011011000

%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];

%t w[n_] := StringReplace[w[n - 1], {"00" -> "1000", "10" -> "01"}]

%t Table[w[n], {n, 0, 8}]

%t st = ToCharacterCode[w[22]] - 48 (* A288736 *)

%t Flatten[Position[st, 0]] (* A288737 *)

%t Flatten[Position[st, 1]] (* A288740 *)

%Y Cf. A288729 (0-limiting word), A288737, A288740, A288733 (1-limiting word), A288741 (3-limiting word).

%K nonn,easy

%O 1

%A _Clark Kimberling_, Jun 16 2017

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 11 03:12 EDT 2021. Contains 342886 sequences. (Running on oeis4.)