|
Search: id:A075458
|
|
|
| A075458 |
|
Domination number for queens' graph Q(n). |
|
+0
2
|
|
| 1, 1, 1, 2, 3, 3, 4, 5, 5, 5, 5, 6, 7, 8, 9, 9, 9, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
W. W. R. Ball and H. S. M. Coxeter,"Math'l Rec. and Essays," 13th Ed. Dover, p. 173.
Matthew D. Kearse and Peter B. Gibbons, "Computational Methods and New Results for Chessboard Problems", Australasian Journal of Combinatorics 23 (2001), 253-284.
M. A. Sainte-Lagu\"{e}, Les R\'{e}seaux (ou Graphes)}, M\'{e}morial des Sciences Math\'{e}matiques, Fasc. 18, Gauthier-Villars, Paris, 1926, p. 49.
|
|
CROSSREFS
|
A002563 gives number of solutions.
Sequence in context: A078338 A007306 A140858 this_sequence A083036 A165706 A073092
Adjacent sequences: A075455 A075456 A075457 this_sequence A075459 A075460 A075461
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 16 2002
|
|
|
Search completed in 0.002 seconds
|
