A002567 - OEIS

This site is supported by donations to The OEIS Foundation.

A002567

Number of nonisomorphic solutions to minimal independent dominating set on queens' graph Q(n).
(Formerly M0389 N0147)

1, 1, 1, 2, 2, 17, 1, 91, 16, 1, 1, 105, 4, 55, 1314, 16, 2, 28 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	REFERENCES	`P. B. Gibbons and J. A. Webb, Some new results for the queens domination problem, Australasian Journal of Combinatorics 15 (1997), pp. 145-160.` `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.` `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).`
	CROSSREFS	`A075324 gives number of queens required.` `Sequence in context: A009804 A027607 A100680 * A206095 A000528 A074970` `Adjacent sequences: A002564 A002565 A002566 * A002568 A002569 A002570`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`a(9) corrected by Peter Gibbons, May 30 2004.`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:26 EST 2012. Contains 205852 sequences.