Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002568 Number of different ways one can attack all squares on an n X n chessboard with the smallest number of queens needed.
(Formerly M3200 N1294)
+0
1
1, 4, 1, 16, 16, 120, 8, 728, 92, 8, 2, 840 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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.

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

Sequence in context: A075499 A099394 A059991 this_sequence A111661 A072651 A093035

Adjacent sequences: A002565 A002566 A002567 this_sequence A002569 A002570 A002571

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(9)-a(12) from Johan Sarnbratt (johan.sarnbratt(AT)gmail.com), Mar 28 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research