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 nonincreasing order.
A222005
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 nonincreasing order.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =2a(5) =1a(6) =24a(7) =12a(8) =2a(9) =1a(10) =120a(11) =157a(12) =22a(13) =2a(14) =1a(15) =720a(16) =3853a(17) =704a(18) =37a(19) =2a(20) =1a(21) =5040a(22) =138715a(23) =78376a(24) =2470a(25) =58a(26) =2a(27) =1a(28) =40320a(29) =6838453
External references
- oeis: A222005