[seqfan] Right-handed knight permutations, powers of 10?

[Ron Hardin]

In https://oeis.org/search?q=id:A209543|id:A209539 there are a lot of trailing 
0's in the counts, and column 4 has a power of 10 recurrence

The definition doesn't seem to suggest it

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

Some solutions for n=4 k=4
..6..7..9..3....0..8..2..3....6..7..2.10....0..7..9..3....6..1..2..3
.10..5..0..1...10.12.13.14....4.12..0..1....4..5..6..1....4.11..0.14
.14..2..4.11....1..9..4.11...14.15..3.11....8..2.10.11....8..9.10..5
.12.13..8.15....5..6..7.15....5.13..8..9...12.13.14.15...12.13..7.15


 rhhardin at mindspring.com
rhhardin at att.net (either)