|
|
A002564
|
|
Number of different ways one can attack all squares on an n X n chessboard using the minimal number of queens.
(Formerly M3199 N1293)
|
|
7
|
|
|
1, 4, 1, 12, 186, 4, 86, 4860, 114, 8, 2, 8, 288, 4632
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of distinct solutions to minimal dominating set on queens' graph Q(n). See A002563 for non-isomorphic solutions.
Number of minimum dominating sets in the n X n queen graph. - Eric W. Weisstein, Dec 31 2017
|
|
REFERENCES
|
W. Ahrens, Mathematische Unterhaltungen und Spiele, second edition (1910), Vol. 1, p. 301.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49.
M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49. [Incomplete annotated scan of title page and pages 18-51]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|