|
|
A263544
|
|
Number of (n+2) X (2+2) arrays of permutations of 0..n*4+7 with each element moved 0 or 1 knight moves and no more than 3 elements left unmoved.
|
|
1
|
|
|
124, 3328, 32284, 692605, 12621312, 200111881, 3073784448, 48234458624, 726559223488, 10674709271961, 154988254877760, 2223132289418925, 31457320738329980, 440684546504612096, 6122020250516984604
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..6..8..2..3....6..7..9..3....9..1..4.10....6..7..4.10....0..7..4.10
.10.11..0.14...13.11..8..1....2..3.15..7....2.12.15.14....2..3..8..9
..1..7.19..5...14..0..4..2....6..0.12..5....1..0..3.11....1.16.19.18
.18..4.16.17...18.19..5.17...18.19.16.17....5.19.16.17...12..6..5.17
..9.15.12.13...16.15.12.10...14..8.11.13....9..8.18.13...14.15.11.13
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|