login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051568 Let M(n) (A051755) be the maximal number of queens that can be placed on an n X n chessboard so that each queen attacks exactly two other queens; a(n) is the number of non-equivalent solutions. "Non-equivalent" means none of the a(n) solutions can be mapped onto any other solution by board rotations through 90, 180 or 270 degrees or mirror operations along the two diagonals or center lines. 2
4, 2, 1, 1, 5, 2, 15, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
REFERENCES
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
M. Gardner, The Colossal Book of Mathematics, 2001, p. 209.
LINKS
CROSSREFS
Sequence in context: A288251 A024553 A051758 * A016509 A332630 A277646
KEYWORD
nonn,nice,more
AUTHOR
N. J. A. Sloane, Dec 11 1999
EXTENSIONS
More precise definition from R. J. Mathar, Mar 13 2006
Edited by N. J. A. Sloane, May 22 2014
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 03:50 EDT 2024. Contains 372356 sequences. (Running on oeis4.)