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 3 elements left unmoved.

A263545

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 3 elements left unmoved.

Terms

    a(0) =20a(1) =124a(2) =124a(3) =884a(4) =3328a(5) =884a(6) =2960a(7) =32284a(8) =32284a(9) =2960a(10) =43808a(11) =692605a(12) =1704784a(13) =692605a(14) =43808a(15) =128576a(16) =12621312a(17) =26361664a(18) =26361664a(19) =12621312a(20) =128576a(21) =1845824a(22) =200111881a(23) =6446653792

External references