This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A002568 Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed. (Formerly M3200 N1294) 4
 1, 4, 1, 16, 16, 120, 8, 728, 92, 8, 2, 840 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For same problem, but with queens in general position (without condition "non-attacking"), see A002564. - Vaclav Kotesovec, Sep 07 2012 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] EXAMPLE a(5) = 16 because it is impossible to attack all squares with 2 queens but with 3 queens you can do it in 16 different ways (with mirroring and rotation). CROSSREFS See A002567 for the number of non-isomorphic solutions. Cf. A002564, A122749, A103315. Sequence in context: A099394 A269698 A059991 * A111661 A072651 A209411 Adjacent sequences:  A002565 A002566 A002567 * A002569 A002570 A002571 KEYWORD nonn AUTHOR EXTENSIONS a(9)-a(12) from Johan Särnbratt, Mar 28 2008 Name of the sequence corrected, Vaclav Kotesovec, Sep 07 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 22 20:51 EDT 2019. Contains 325226 sequences. (Running on oeis4.)