Square array read by descending antidiagonals. T(n,k) is the number of ways to factor a permutation of [2n] into exactly k good factors, n>=0, k>=0.
A341268
Square array read by descending antidiagonals. T(n,k) is the number of ways to factor a permutation of [2n] into exactly k good factors, n>=0, k>=0.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =5a(9) =0a(10) =1a(11) =3a(12) =16a(13) =61a(14) =0a(15) =1a(16) =4a(17) =33a(18) =272a(19) =1385a(20) =0a(21) =1a(22) =5a(23) =56a(24) =723a(25) =7936a(26) =50521a(27) =0a(28) =1a(29) =6
External references
- oeis: A341268