%I #16 Oct 08 2014 04:30:30
%S 1,2,1,1,2,2,1,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,2,1,1,2,1,2,1,1,2,2,1,
%T 2,1,1,2,2,1,2,2,1,2,2,1,2,1,1,2,1,1,2,2,1,2,1,1,2,2,1,2,1,2,2,1,1,2,
%U 1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,2,2,1,1,2,1,1,2,2,1,1,2,1,2,1
%N Bisection of Kolakoski sequence A000002.
%C Lengths of runs of ones in A000002. - _Reinhard Zumkeller_, Aug 03 2013
%C As in the Kolakoski sequence itself, the length of runs in this sequence is 1 or 2 : a run X,X,X is not possible, since it would imply X,Y,X,Y,X in the Kolakoski sequence, which in turn would imply 1, 1, 1 somewhere before (one Y, one X, one Y) which is not possible. - _Jean-Christophe Hervé_, Oct 04 2014
%H Reinhard Zumkeller, <a href="/A100428/b100428.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o a100428 n = a100428_list !! n
%o a100428_list = f a000002_list where f (u:_:us) = u : f us
%o -- _Reinhard Zumkeller_, Aug 03 2013
%Y Cf. A100429, A216345.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, Nov 20 2004
%E More terms from _Joshua Zucker_, May 12 2006
%E Offset changed by _Reinhard Zumkeller_, Aug 03 2013