proposed

approved

editing

proposed

0-limiting word of the morphism 0 -> 1, 1 -> 0110.

The morphism 0 -> 1, 1 -> 0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0110 -> 1011001101 -> 0110101100110110110011010110; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0110 -> 1011001101, as in A284656.

proposed

editing

editing

proposed

The morphism 0->1, 1->0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0110 -> 1011001101 -> 0110101100110110110011010110; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0110 -> 1011001101, as in A284656.

proposed

editing

editing

proposed

allocated for Clark Kimberling0-limiting word of the morphism 0->1, 1-> 0110.

0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0

1

The morphism 0->1, 1->0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0110 -> 1011001101 -> 0110101100110110110011010110; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0110 -> 1011001101, as in A284656.

Clark Kimberling, <a href="/A284653/b284653.txt">Table of n, a(n) for n = 1..10000</a>

s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 1, 1, 0}}] &, {0}, 6] (* A284653 *)

Flatten[Position[s, 0]] (* A284654 *)

Flatten[Position[s, 1]] (* A284655 *)

Cf. A284654, A284655, A284656.

allocated

nonn,easy

Clark Kimberling, Apr 07 2017

approved

editing

allocating

allocated

allocated for Clark Kimberling

allocating

approved