A111081 Successive generations of an alternating Kolakoski rule.

1, 2, 11, 21, 221, 22112, 11221211, 21221121121, 2212211212212112, 1122122112122122112112122, 12112212211212212211211221211212212211, 211212211211221211211221221121221211221221211211221221121

Offset: 1

Author

Benoit Cloitre, Oct 11 2005

Keywords

• nonn
• base

Comments

Strings are obtained using the Kolakoski substitution and the additional rule : start with 1 if previous string ends with 2, start with 2 if previous string ends with 1. The concatenation of those strings gives 1211212212211211221211...which is A006928 word. If you replace the initial 1 with 12 you get 122112122122112112212...the infinite Kolakoski word A000002.

Examples

			1-->2-->11-->21-->221-->22112-->11221211
		

Crossrefs

Cf. A000002, A054349.

Formula

Conjecture : length of n-th string is asymptotic to c*(3/2)^n for some c.