

A261752


Minimum number of knights on an n X n chessboard such that every square is attacked.


2



6, 7, 8, 10, 14, 18, 22, 25, 28, 32, 36, 43, 48, 54, 58, 66, 70, 78, 84, 91, 98, 107, 112, 123, 128, 139, 146, 156, 164
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

4,1


COMMENTS

Total domination number of n X n knight graph.
Distinct from A006075 since here all squares must be attacked, whereas, in A006075, all squares are either attacked or occupied.
a(34) = 182, a(36) = 202, a(38) = 224.  Andy Huchala, Jun 04 2021


LINKS



EXAMPLE

An example for the 4 X 4 case:
....
.NNN
.N..
NN..
and for the 5 x 5 case:
.....
..N..
.NN..
NNN..
N....


CROSSREFS



KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



