Triangle: T(n,k) = number of compositions (ordered partitions) of n such that some part is repeated consecutively k times and no part is repeated consecutively more than k times.
A091613
Triangle: T(n,k) = number of compositions (ordered partitions) of n such that some part is repeated consecutively k times and no part is repeated consecutively more than k times.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =0a(5) =1a(6) =4a(7) =3a(8) =0a(9) =1a(10) =7a(11) =6a(12) =2a(13) =0a(14) =1a(15) =14a(16) =10a(17) =5a(18) =2a(19) =0a(20) =1a(21) =23a(22) =23a(23) =11a(24) =4a(25) =2a(26) =0a(27) =1a(28) =39a(29) =50
External references
- oeis: A091613