T(n,k)=Number of nXk array permutations with every element making zero or one right-handed knight moves (out 2, right 1).

A209543

T(n,k)=Number of nXk array permutations with every element making zero or one right-handed knight moves (out 2, right 1).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =2a(9) =1a(10) =1a(11) =4a(12) =16a(13) =4a(14) =1a(15) =1a(16) =8a(17) =72a(18) =72a(19) =8a(20) =1a(21) =1a(22) =16a(23) =243a(24) =729a(25) =243a(26) =16a(27) =1a(28) =1a(29) =32

External references