T(n,k) = Number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.
A263519
T(n,k) = Number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.
Terms
- a(0) =3a(1) =7a(2) =8a(3) =15a(4) =35a(5) =23a(6) =29a(7) =160a(8) =208a(9) =66a(10) =53a(11) =660a(12) =2076a(13) =1198a(14) =190a(15) =93a(16) =2651a(17) =18369a(18) =25968a(19) =7022a(20) =547a(21) =159a(22) =10350a(23) =158109a(24) =489294a(25) =331130a(26) =41035a(27) =1575a(28) =267a(29) =39807
External references
- oeis: A263519