Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 30 2012 18:57:05
%S 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 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 42,22,11,5,1,1,10,37,72,99,104,86,56,31,10,1,0,1,11,46,102,155,182
%N 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 Row sums: A006053.
%D 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 T(5,2) counts the words 10100, 10010, 10001. Top of triangle T:
%e 1 = T(1,1)
%e 1 0 = T(2,1) T(2,2)
%e 1 1 1 = T(3,1) T(3,2) T(3,3)
%e 1 2 1 0
%e 1 3 2 2 1
%Y Cf. A078804, A078805.
%K nonn,tabl
%O 1,8
%A _Clark Kimberling_, Dec 07 2002