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 A074293 #11 Jul 29 2017 23:47:52
%S A074293 1,2,2,1,1,2,1,2,2,1,1,2,2,1,2,1,2,2,1,2,1,2,1,2,1,2,1,2,2,1,2,1,2,1,
%T A074293 2,1,1,2,1,2,1,2,2,1,2,1,2,1,1,2,1,1,2,2,1,2,2,2,1,2,1,2,2,1,2,1,2,1,
%U A074293 2,2,1,2,1,2,2,2,1,1,2,1,2,1,2,1,2
%N A074293 Dominant (i.e., most populous) digit in Kolakoski sequence (A000002) when partitioned into groups of 5.
%H A074293 Nathaniel Johnston, <a href="/A074293/b074293.txt">Table of n, a(n) for n = 0..10000</a>
%e A074293 The Kolakoski sequence begins (1,2,2,1,1), (2,1,2,2,1), (2,2,1,1,2), (1,1,2,2,1), hence sequence begins 1,2,2,1.
%p A074293 lim:=400: s:=[1,2,2]: for n from 3 to lim do for i from 1 to s[n] do s:=[op(s),1+((n-1)mod 2)]: od: od: lim2:=floor(nops(s)/5)-1: for n from 0 to lim2 do if(s[5*n+1]+s[5*n+2]+s[5*n+3]+s[5*n+4]+s[5*n+5]<=7)then printf("1, "): else printf("2, "): fi: od: # _Nathaniel Johnston_, May 01 2011
%Y A074293 Cf. A074292, A074295.
%K A074293 nonn,easy
%O A074293 0,2
%A A074293 _Jon Perry_, Sep 21 2002