|
| |
|
|
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
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
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
| Cf. A078804, A078805.
Sequence in context: A119270 A175804 A195017 * A173438 A103493 A121480
Adjacent sequences: A078803 A078804 A078805 * A078807 A078808 A078809
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), Dec 07 2002
|
| |
|
|
