|
|
A263953
|
|
Number of (n+2)X(2+2) arrays of permutations of 0..n*4+7 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
40, 606, 8783, 135933, 2222154, 36482594, 597854055, 9871552803, 163131172868, 2693232362730, 44459353882426, 734216744614975, 12125829937309705, 200247240702667641, 3306824333319457287, 54608938288288875708
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2..5....0..1..2..3....0..1..4..5....0..1..2..5....0..1..4..5
..4.14.15..7....4.11.15..7....2.14..8..9....4.14..8..9....2..3.15..7
..6..9..3.11....8..9.10..5....6.15..3.18....6..7..3.13....8..9.12.11
.10.20..8.22...12.13.23..6...12.19..7.22...10.11.21.22...10.19.14..6
.16.17.12.21...16.17.18.19...16.23.11.10...16.23.20.19...16.23.18.13
.18.19.13.23...20.21.22.14...20.21.13.17...18.12.15.17...20.21.22.17
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|