T(n,k)=Number of nXk array permutations with every element making zero or one right-handed knight moves (out 2, right 1)
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 16, 4, 1, 1, 8, 72, 72, 8, 1, 1, 16, 243, 729, 243, 16, 1, 1
1 seqfan posts
Sat Mar 10 16:56:20 CET 2012 [seqfan] Right-handed knight permutations, powers of 10?