A263567 Number of (n+2)X(3+2) arrays of permutations of 0..n*5+9 with each element moved 0 or 1 knight moves and no more than 1 element left unmoved.

96, 1296, 67600, 313600, 273566336, 830361856, 319928499712, 953450696704

Offset

1,1

Comments

Column 3 of A263568.

Links

Table of n, a(n) for n=1..8.

Example

Some solutions for n=3
..7.10..5..6..4....7.10..9..6.13....7.10..9.14.13....0..8..9..6..7
..2.15.14.17.12....2.15.16..1.12....2.15..4.19.18....2..3.14..1.18
..1..0..9.24..3...21..0..3..4.23....1..0.23.22..3...21.20.15..4.23
.22.23.20.21..8...22..5.20.11..8....6..5.24.21..8...22..5.24.11.12
.11.18.19.16.13...17.18.19.14.24...20.12.11.16.17...17.10.19.16.13

Crossrefs

Cf. A263568.

Sequence in context: A187165 A229533 A282017 * A223292 A168526 A128962

Adjacent sequences: A263564 A263565 A263566 * A263568 A263569 A263570

Keyword

nonn

Author

R. H. Hardin, Oct 21 2015

Status

approved