|
|
A187176
|
|
Number of 6-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.
|
|
1
|
|
|
0, 0, 0, 0, 0, 88, 496, 1440, 3064, 5344, 8208, 11640, 15640, 20208, 25344, 31048, 37320, 44160, 51568, 59544, 68088, 77200, 86880, 97128, 107944, 119328, 131280, 143800, 156888, 170544, 184768, 199560, 214920, 230848, 247344, 264408, 282040
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 284*n^2 - 3100*n + 7944 for n>9.
G.f.: 8*x^6*(11 + 29*x + 27*x^2 + 18*x^3 - 3*x^4 - 9*x^5 - 2*x^6) / (1 - x)^3 (conjectured). - Colin Barker, Apr 22 2018
|
|
EXAMPLE
|
Some solutions for 6 X 6:
..0..0..0..5..0..0....0..0..0..0..0..0....0..0..4..0..0..0....0..0..0..6..0..0
..0..6..0..0..0..0....0..0..0..0..6..0....3..0..0..0..0..0....0..1..0..0..0..0
..0..0..0..0..4..0....0..0..5..0..0..0....0..0..0..5..0..0....0..0..0..0..5..0
..0..0..1..0..0..0....4..0..0..0..0..1....0..2..0..0..0..0....0..0..2..0..0..0
..0..0..0..0..0..3....0..0..0..2..0..0....0..0..0..0..6..0....0..0..0..0..0..4
..0..0..0..2..0..0....0..3..0..0..0..0....0..0..1..0..0..0....0..0..0..3..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|