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!)
A051571 Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=4 and sequence gives number of different solutions when N takes its maximal value. 12
0, 0, 0, 1, 3, 40, 615, 16573 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,5
REFERENCES
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
LINKS
CROSSREFS
Sequence in context: A005724 A215196 A093376 * A019654 A361069 A327070
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
Probably an incorrect version of A019654.
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 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)