This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A022300 #8 Nov 22 2017 01:15:01
%S A022300 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,
%T A022300 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,
%U A022300 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
%N 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.
%C A022300 It appears that various properties and unsolved problems associated with the Kolakoski sequence, A000002, apply also to A022300.
%H A022300 Clark Kimberling, <a href="/A022300/b022300.txt">Table of n, a(n) for n = 1..20000</a>
%e A022300 a(1) =1, so the 3rd run has length 1, so a(5) must be 2.
%e A022300 a(2) = 1, so the 4th run has length 1, so a(6) = 1.
%e A022300 a(3) = 2, so the 5th run has length 2, so a(7) = 1 and a(8) = 2.
%e A022300 a(4) = 1, so the 6th run has length 1, so a(9) = 1.
%e A022300 Globally, the runlength sequence of a is 2,1,1,1,2,1,2,1,1,2,1,1,2,...., and deleting the first two terms leaves a = A022300.
%t A022300 a = {1, 1, 2}; Do[a = Join[a, ConstantArray[If[Last[a] == 1, 2, 1], {a[[n]]}]], {n, 200}]; a
%t A022300 (* _Peter J. C. Moses_, Apr 01 2016 *)
%Y A022300 Cf. A022303, A006928, A000002.
%K A022300 nonn
%O A022300 1,3
%A A022300 _Clark Kimberling_
%E A022300 Clarified and augmented by _Clark Kimberling_, Apr 02 2016