[go: up one dir, main page]

login
A209537
Number of n X n array permutations with every element making zero or one right-handed knight moves (out 2, right 1)
0
1, 1, 16, 729, 103680, 92160000, 366400000000, 6638067426640896
OFFSET
1,3
COMMENTS
Diagonal of A209543
EXAMPLE
Some solutions for n=4
..6..8..2..3....6..8..2..3....0..7..2..3....6..7..2..3....0..8..2.10
..4.11..0.14....4..5..0.14...10.12..6..1...10..5..0.14....4.12.13..1
..1..9.10..5....1..9.10.11...14..9..4.11....1.15..4.11...14..9..3.11
.12.13..7.15...12.13..7.15....5.13..8.15...12.13..8..9....5..6..7.15
CROSSREFS
Sequence in context: A221023 A171736 A062206 * A086701 A218297 A339202
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 10 2012
STATUS
approved