A111123 -id:A111123 - cp's OEIS frontend

A054349 Successive generations of the variant of the Kolakoski sequence described in A042942.

2, 22, 2211, 221121, 221121221, 22112122122112, 2211212212211211221211, 221121221221121122121121221121121, 2211212212211211221211212211211212212211212212112

Offset: 0

N. J. A. Sloane, May 07 2000

For n >= 0, let f_1(n) be the number of 1's in a(n) (sequence begins: 0, 0, 2, 3, 4, 6, 11, 17, 24, ...) and f_2(n) be the number of 2's (sequence begins: 1, 2, 2, 3, 5, 8, 11, 16, 25, ...). Then there is a simple relation between f_1 and f_2, namely: f_1(n) = 1 - f_2(n) + f_2(n-1) + f_2(n-2) + ... + f_2(0). i.e. f_1(7) = 17 and 1 - f_2(7) + f_2(6) + ... + f_2(0) = 1 - 16 + 11 + 8 + 5 + 3 + 2 + 2 + 1 = 17. - Benoit Cloitre, Oct 11 2005

Bertran Steinsky, A Recursive Formula for the Kolakoski Sequence A000002, J. Integer Sequences, Vol. 9 (2006), Article 06.3.7.

Cf. A000002, A054348, A054350, A054351, A111123, A111124.

Word lengths give A042942.

More terms from David Wasserman, Mar 04 2002

A111124 Number of 1's in n-th "Kolakoski" string defined in A054349.

Original entry on oeis.org

0, 0, 2, 3, 4, 6, 11, 17, 24, 36, 55, 84, 127, 189, 284, 432, 648, 970, 1452, 2179, 3262, 4889, 7346, 11006, 16524, 24774, 37177, 55771, 83685, 125548, 188329, 282487, 423692, 635489, 953271, 1430014, 2144962, 3217488, 4826220, 7239443, 10859222, 16288208, 24432262

Offset: 0

Benoit Cloitre, Oct 16 2005

nonn

Cf. A001083, A042942, A054349, A111123 (number of 2's).

More terms from and offset changed to 0 by Jinyuan Wang, Apr 03 2020

cp's OEIS Frontend

A054349 Successive generations of the variant of the Kolakoski sequence described in A042942.

Views

Author

Keywords

Comments

Links

Crossrefs