T(n,k) = number of permutations of 0..floor((n*k-2)/2) on odd squares of an n X k array such that each row and column of odd squares is increasing.
A215297
T(n,k) = number of permutations of 0..floor((n*k-2)/2) on odd squares of an n X k array such that each row and column of odd squares is increasing.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =6a(12) =6a(13) =6a(14) =1a(15) =1a(16) =10a(17) =30a(18) =30a(19) =10a(20) =1a(21) =1a(22) =20a(23) =70a(24) =280a(25) =70a(26) =20a(27) =1a(28) =1a(29) =35
External references
- oeis: A215297