T(n,k)=Number of nXk arrays with each row a permutation of 1..k having at least as many downsteps as the preceding row, with rows in lexicographically nondecreasing order.
A222159
T(n,k)=Number of nXk arrays with each row a permutation of 1..k having at least as many downsteps as the preceding row, with rows in lexicographically nondecreasing order.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =3a(5) =1a(6) =24a(7) =21a(8) =4a(9) =1a(10) =120a(11) =277a(12) =56a(13) =5a(14) =1a(15) =720a(16) =6322a(17) =2132a(18) =126a(19) =6a(20) =1a(21) =5040a(22) =215659a(23) =207262a(24) =12521a(25) =252a(26) =7a(27) =1a(28) =40320a(29) =10218797
External references
- oeis: A222159