Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.
A340986
Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =3a(9) =0a(10) =1a(11) =3a(12) =10a(13) =19a(14) =0a(15) =1a(16) =4a(17) =21a(18) =92a(19) =211a(20) =0a(21) =1a(22) =5a(23) =36a(24) =255a(25) =1354a(26) =3651a(27) =0a(28) =1a(29) =6
External references
- oeis: A340986