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 A074295 #9 Jul 29 2017 23:48:14
%S A074295 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,2,1,1,1,2,2,2,1,2,2,1,2,1,2,2,2,1,1,2,
%T A074295 1,2,1,1,2,1,2,1,2,2,2,1,1,2,1,2,1,2,2,2,1,1,2,1,2,1,1,2,1,1,2,2,1,1,
%U A074295 2,1,2,1,1,2,2,2,1,2,2,1,1,2,1,1,1,2,1
%N A074295 Dominant (i.e., most populous) digit in Kolakoski sequence (A000002) when partitioned into groups of 7.
%H A074295 Nathaniel Johnston, <a href="/A074295/b074295.txt">Table of n, a(n) for n = 1..10000</a>
%e A074295 Kolakoski : (1,2,2,1,1,2,1),(2,2,1,2,2,1,1),(2,1,1,2,2,1,2),... hence 1,2,2,...
%p A074295 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)/7)-1: for n from 0 to lim2 do if(add(s[7*n+k],k=1..7)<=10)then printf("1, "): else printf("2, "): fi: od: # _Nathaniel Johnston_, May 01 2011
%Y A074295 Cf. A074292, A074293.
%K A074295 nonn,base,easy
%O A074295 1,2
%A A074295 _Jon Perry_, Sep 21 2002