|
Search: id:A091613
|
|
|
| A091613 |
|
Triangle: T(n,k) = number of ordered partitions of n such that some part is repeated consecutively k times and no part is repeated consecutively more than k times. |
|
+0
8
|
|
| 1, 1, 1, 3, 0, 1, 4, 3, 0, 1, 7, 6, 2, 0, 1, 14, 10, 5, 2, 0, 1, 23, 23, 11, 4, 2, 0, 1, 39, 50, 22, 10, 4, 2, 0, 1, 71, 99, 48, 22, 9, 4, 2, 0, 1, 124, 200, 105, 46, 21, 9, 4, 2, 0, 1, 214, 404, 223, 101, 46, 20, 9, 4, 2, 0, 1, 378, 805, 468, 218, 98, 45, 20, 9, 4, 2, 0, 1, 661, 1599
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
1; 1,1; 3,0,1; 4,3,0,1; 7,6,2,0,1; ...
In the partition 3+3+2+2+2+1+3+3+1, 2 is repeated consecutively 3 times, no part is repeated consecutively more than 3 times. (3 appears 4 times nonconsecutively.)
|
|
CROSSREFS
|
Row sums: A000079(n-1) (2^(n-1)). Inverse: A091614. Square: A091615.
Columns 1-6: A003242, A091616-A091620. Convergent of columns: A034007.
Adjacent sequences: A091610 A091611 A091612 this_sequence A091614 A091615 A091616
Sequence in context: A048963 A119458 A106356 this_sequence A039727 A137176 A124323
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Jan 23 2004
|
|
|
Search completed in 0.002 seconds
|
