T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and no more than 1 element left unmoved.

A263568

T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and no more than 1 element left unmoved.

Terms

    a(0) =4a(1) =16a(2) =16a(3) =96a(4) =256a(5) =96a(6) =256a(7) =1296a(8) =1296a(9) =256a(10) =5632a(11) =28561a(12) =67600a(13) =28561a(14) =5632a(15) =9216a(16) =331776a(17) =313600a(18) =313600a(19) =331776a(20) =9216a(21) =184320a(22) =4100625a(23) =273566336a(24) =106172416a(25) =273566336a(26) =4100625a(27) =184320a(28) =262144a(29) =49787136

External references