|
|
A287393
|
|
Domination number for knight graph on a 2 X n board.
|
|
3
|
|
|
0, 2, 4, 4, 4, 4, 4, 6, 8, 8, 8, 8, 8, 10, 12, 12, 12, 12, 12, 14, 16, 16, 16, 16, 16, 18, 20, 20, 20, 20, 20, 22, 24, 24, 24, 24, 24, 26, 28, 28, 28, 28, 28, 30, 32, 32, 32, 32, 32, 34, 36, 36, 36, 36, 36, 38, 40, 40, 40, 40, 40, 42, 44, 44, 44, 44, 44, 46
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Minimum number of knights required to dominate a 2 X n board.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2*(floor((n+4)/6) + floor((n+5)/6)).
G.f.: 2*x / ((1 - x)^2*(1 - x + x^2)*(1 + x + x^2)).
a(n) = 2*a(n-1) - 2*a(n-2) + 2*a(n-3) - 2*a(n-4) + 2*a(n-5) - a(n-6) for n>5.
(End)
|
|
EXAMPLE
|
For n=3 we need a(3)=4 knights to dominate a 2 X 3 board.
|
|
MATHEMATICA
|
Table[2*(Floor[(i+4)/6]+Floor[(i+5)/6]), {i, 0, 67}]
LinearRecurrence[{2, -2, 2, -2, 2, -1}, {0, 2, 4, 4, 4, 4}, 70] (* Harvey P. Dale, Jul 07 2020 *)
|
|
PROG
|
(Python) [2*((i+4)//6+(i+5)//6) for i in range(68)]
(PARI) concat(0, Vec(2*x / ((1 - x)^2*(1 - x + x^2)*(1 + x + x^2)) + O(x^100))) \\ Colin Barker, May 27 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|