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 A342799 #11 Jul 03 2021 08:28:22
%S A342799 1,5,7,17,23,25,29,31,32,33,34,35,37,41,43,49,51,52,53,55,59,61,71,73,
%T A342799 79,125,131,133,134,135,137,141,143,149,161,179,185,187,191,193,194,
%U A342799 195,196,197,199,201,202,203,205,209,211,221,223,227,229,230,231
%N A342799 Numbers m such that there are more 1s than 2s in {K(1), .., K(m)}, where K = A000002 (Kolakoski sequence).
%C A342799 The three sequences A022292 (without the initial 0), A074261, and A342799 partition the positive integers.
%e A342799 The Kolakoski sequence is (1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, ...), so that a(1) = 1, a(2) = 5.
%t A342799 k = Prepend[Nest[Flatten[Partition[#, 2] /. {{2, 2} -> {2, 2, 1, 1}, {2, 1} -> {2, 2, 1}, {1, 2} -> {2, 1, 1}, {1, 1} -> {2, 1}}] &, {2, 2}, 14], 1]; (* A000002 *)
%t A342799 Select[Range[400], Count[Take[k, #], 1] < #/2 &] (* A074261 *)
%t A342799 Select[Range[400], Count[Take[k, #], 1] == #/2 &] (* A022292 *)
%t A342799 Select[Range[400], Count[Take[k, #], 1] > #/2 &] (* A342799 *)
%Y A342799 Cf. A000002, A022292, A022293, A074261.
%K A342799 nonn
%O A342799 1,2
%A A342799 _Clark Kimberling_, May 10 2021