T(n,k) = Number of n X k array permutations with each element making a single king move.

Terms

a(0) =0a(1) =1a(2) =1a(3) =0a(4) =9a(5) =0a(6) =1a(7) =33a(8) =33a(9) =1a(10) =0a(11) =185a(12) =192a(13) =185a(14) =0a(15) =1a(16) =913a(17) =4081a(18) =4081a(19) =913a(20) =1a(21) =0a(22) =4777a(23) =47936a(24) =251720a(25) =47936a(26) =4777a(27) =0a(28) =1a(29) =24577