cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A002566 Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.

This page as a plain text file.
%I A002566 M4130 N1713 #42 Jun 12 2025 21:38:31
%S A002566 0,6,20,12,70,960,22,352,10,216,4814,72
%N A002566 Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.
%C A002566 Differs from A002564 and A002568 in that each queen is attacking at least one other queen.
%C A002566 M. A. Sainte-Laguë paper has "a(6)=900?".
%C A002566 In other words, the number of minimum total dominating sets in the n X n queen graph. - _Eric W. Weisstein_, Apr 19 2018
%D A002566 W. Ahrens, Mathematische Unterhaltungen und Spiele, second edition (1910), Vol. 1, p. 301.
%D A002566 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A002566 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002566 M. A. Sainte-Laguë, <a href="https://eudml.org/doc/192551">Les Réseaux (ou Graphes)</a>, Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49.
%H A002566 M. A. Sainte-Laguë, <a href="/A002560/a002560.pdf">Les Réseaux (ou Graphes)</a>, 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]
%H A002566 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumTotalDominatingSet.html">Minimum Total Dominating Set</a>.
%H A002566 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/QueenGraph.html">Queen Graph</a>.
%Y A002566 Cf. A002565 (number of ways up to isomorphism).
%K A002566 nonn,hard,more
%O A002566 1,2
%A A002566 _N. J. A. Sloane_
%E A002566 a(6) corrected and a(9)-a(11) by _Sean A. Irvine_, Apr 05 2014
%E A002566 Better name from _Sean A. Irvine_, Apr 05 2014
%E A002566 a(12) from _Eric W. Weisstein_, Apr 05 2025