|
|
A263708
|
|
Number of (2+2) X (n+2) arrays of permutations of 0..n*4+7 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.
|
|
1
|
|
|
569, 18995, 474101, 14115520, 452888405, 14143461755, 445447784440, 14172257092592, 454737017844040, 14624541206729483, 472474884440064077, 15320841681004133632, 498414099492357284253, 16258226314270163231635
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0.10..2..3....0.10..9..3....0..8..9..3....9..1..4.10....6..8..4..3
.13.14..6..7...13.12..6.14...13.12..6..7....2.12..0..7....2.12.15..7
..1.15.12.11....8..2..1.11....1..2.10.11...14.15..3.11....1..0.10.13
..5..4..8..9....5..4..7.15....5..4.14.15....5.13..8..6....5.11.14..9
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|