

A103315


Sequence A006075 gives minimal number of knights needed to cover an n X n board. This sequence gives total number of solutions using A006075(n) knights (compare A006076).


7



1, 1, 8, 9, 47, 127, 10, 2, 2, 4, 800, 2, 152, 4, 504, 2, 212, 19562
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

In other words, the number of minimum dominating sets for the n X n knight graph.  Eric W. Weisstein, May 05 2017


LINKS

Table of n, a(n) for n=1..18.
Lee Morgenstern, Knight Domination.
Frank Rubin, Knight coverings for large chessboards, 2000.
Eric Weisstein's World of Mathematics, Knight Graph.
Eric Weisstein's World of Mathematics, Minimum Dominating Set.


CROSSREFS

Cf. A006075, A006076, A098604.
Sequence in context: A048068 A037957 A165239 * A175931 A270013 A042847
Adjacent sequences: A103312 A103313 A103314 * A103316 A103317 A103318


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Mar 20 2005, following a suggestion from Lee Morgenstern.


STATUS

approved



