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 A080586 #6 May 04 2014 10:42:41
%S A080586 1,1,1,2,2,2,1,1,1,1,1,1,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,
%T A080586 2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,
%U A080586 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A080586 A run of 3*2^n 1's followed by a run of 3*2^n 2's, for n=0, 1, 2, ...
%F A080586 a(n) = ( 3 - (-1)^A079944(A002264(n)) )/2, A079944(A002264(n))=floor(log[2](4*(floor((n+6)/3))/3)) - floor(log[2](floor((n+6)/3))) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 24 2003
%F A080586 Also a(n) = 1+A079944(A002264(n))=floor(log[2](8*(floor((n+6)/3))/3)) - floor(log[2](floor((n+6)/3))) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 24 2003
%p A080586 f := (c,n)->seq(c,i=1..3*2^n); [f(1,0),f(2,0),f(1,1),f(2,1),f(1,2),f(2,2),f(1,3),f(2,3)]; f;
%t A080586 Flatten[Table[{PadRight[{},3*2^n,1],PadRight[{},3*2^n,2]},{n,0,4}]] (* _Harvey P. Dale_, May 04 2014 *)
%Y A080586 Cf. A079948, A080587.
%Y A080586 Equals 1 + A080584.
%K A080586 nonn
%O A080586 0,4
%A A080586 _N. J. A. Sloane_, Feb 23 2003