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 A078806 #5 Mar 30 2012 18:57:05 %S A078806 1,1,0,1,1,1,1,2,1,0,1,3,2,2,1,1,4,4,4,1,0,1,5,7,7,4,3,1,1,6,11,12,10, %T A078806 6,1,0,1,7,16,20,20,13,7,4,1,1,8,22,32,36,28,19,8,1,0,1,9,29,49,61,56, %U A078806 42,22,11,5,1,1,10,37,72,99,104,86,56,31,10,1,0,1,11,46,102,155,182 %N A078806 Triangular array T given by T(n,k)= number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 1. %C A078806 Row sums: A006053. %D A078806 Clark Kimberling, Binary words with restricted repetitions and associated compositions of integers, in Applications of Fibonacci Numbers, vol.10, Proceedings of the Eleventh International Conference on Fibonacci Numbers and Their Applications, William Webb, editor, Congressus Numerantium, Winnipeg, Manitoba 194 (2009) 141-151. %e A078806 T(5,2) counts the words 10100, 10010, 10001. Top of triangle T: %e A078806 1 = T(1,1) %e A078806 1 0 = T(2,1) T(2,2) %e A078806 1 1 1 = T(3,1) T(3,2) T(3,3) %e A078806 1 2 1 0 %e A078806 1 3 2 2 1 %Y A078806 Cf. A078804, A078805. %K A078806 nonn,tabl %O A078806 1,8 %A A078806 _Clark Kimberling_, Dec 07 2002