login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002563 Number of nonisomorphic solutions to minimal dominating set on queens' graph Q(n).
(Formerly M3142 N1273)
1
1, 1, 1, 3, 37, 1, 13, 638, 21, 1, 1, 1, 41, 588, 25872 (list; graph; refs; listen; history; internal format)
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.

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

A075458 gives number of queens required.

Sequence in context: A080807 A006268 A073236 * A140448 A128061 A176240

Adjacent sequences:  A002560 A002561 A002562 * A002564 A002565 A002566

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 10:28 EST 2012. Contains 205904 sequences.