login
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.
2
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, 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, 42, 22, 11, 5, 1, 1, 10, 37, 72, 99, 104, 86, 56, 31, 10, 1, 0, 1, 11, 46, 102, 155, 182
OFFSET
1,8
COMMENTS
Row sums: A006053.
REFERENCES
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.
EXAMPLE
T(5,2) counts the words 10100, 10010, 10001. Top of triangle T:
1 = T(1,1)
1 0 = T(2,1) T(2,2)
1 1 1 = T(3,1) T(3,2) T(3,3)
1 2 1 0
1 3 2 2 1
CROSSREFS
Sequence in context: A340251 A286957 A195017 * A173438 A376701 A103493
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Dec 07 2002
STATUS
approved