T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.

A263955

T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.

Terms

    a(0) =6a(1) =40a(2) =36a(3) =118a(4) =606a(5) =158a(6) =354a(7) =5900a(8) =8783a(9) =614a(10) =1209a(11) =63788a(12) =246718a(13) =135933a(14) =2596a(15) =4334a(16) =832934a(17) =7955810a(18) =11302184a(19) =2222154a(20) =11045a(21) =14525a(22) =9289071a(23) =346346808a(24) =1265538562a(25) =567198796a(26) =36482594a(27) =47252a(28) =46022a(29) =99951445

External references