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!)
A051757 Consider problem of placing A051754(n) queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives number of solutions up to square symmetry. 2
2, 7, 5, 93, 2, 149, 49, 1, 12897, 2238 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
When n is a multiple of 3, the bound of 2[2n/3] queens is so tight that in solutions with that number of queens, all attacks must be along rows or columns, making solutions rare. - Jud McCranie
REFERENCES
Martin Gardner, The Last Recreations, Copernicus, 1997, 274-283.
LINKS
CROSSREFS
Sequence in context: A343780 A094360 A335594 * A193746 A070524 A259830
KEYWORD
nonn,nice
AUTHOR
Robert Trent (trentrd(AT)hotmail.com), Aug 23 2000
EXTENSIONS
More terms from Jud McCranie, Aug 14 2001
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 April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)