A022300 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A022300

The sequence a of 1's and 2's starting with (1,1,2,1) such that a(n) is the length of the (n+2)nd run of a.

1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

It appears that various properties and unsolved problems associated with the Kolakoski sequence, A000002, apply also to A022300.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..20000

EXAMPLE

a(1) =1, so the 3rd run has length 1, so a(5) must be 2.

a(2) = 1, so the 4th run has length 1, so a(6) = 1.

a(3) = 2, so the 5th run has length 2, so a(7) = 1 and a(8) = 2.

a(4) = 1, so the 6th run has length 1, so a(9) = 1.