T(n,k)=Number of nXk array permutations with each element making zero or one knight moves.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =4a(8) =4a(9) =1a(10) =1a(11) =16a(12) =49a(13) =16a(14) =1a(15) =1a(16) =36a(17) =569a(18) =569a(19) =36a(20) =1a(21) =1a(22) =81a(23) =4372a(24) =22865a(25) =4372a(26) =81a(27) =1a(28) =1a(29) =225