|
Search: id:A078806
|
|
|
| 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. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
Row sums: A006053.
|
|
REFERENCES
|
C. Kimberling, Binary Words with Restricted Repetitions and Associated Compositions of Integers, preprint.
|
|
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: A048983 A118344 A119270 this_sequence A103493 A121480 A082601
Adjacent sequences: A078803 A078804 A078805 this_sequence A078807 A078808 A078809
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Dec 07 2002
|
|
|
Search completed in 0.002 seconds
|
