login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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

Table of n, a(n) for n=3..10.

CROSSREFS

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

Sequence in context: A005724 A215196 A093376 * A019654 A327070 A156356

Adjacent sequences:  A051568 A051569 A051570 * A051572 A051573 A051574

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 12:07 EST 2019. Contains 329862 sequences. (Running on oeis4.)