login
This site is supported by donations 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. 1
2, 7, 5, 93, 2, 149, 49, 1, 12897, 2238 (list; graph; refs; listen; history; 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.

CROSSREFS

Cf. A051754-A051759, A051567-A051571, A019654.

Sequence in context: A180510 A152555 A094360 * A193746 A070524 A021366

Adjacent sequences:  A051754 A051755 A051756 * A051758 A051759 A051760

KEYWORD

nonn,nice

AUTHOR

Robert Trent (trentrd(AT)hotmail.com), Aug 23 2000

EXTENSIONS

More terms from Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Aug 14 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:07 EST 2012. Contains 205930 sequences.