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!)
A051570 Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value. 2
2, 4, 31, 307, 2, 9, 755, 39302 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

COMMENTS

I would also like to get the sequences that gives the maximal values of N.

REFERENCES

M. Gardner, The Last Recreations, Springer, 1997, p. 282.

LINKS

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

CROSSREFS

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

Sequence in context: A051569 A087186 A051759 * A082913 A083205 A019542

Adjacent sequences:  A051567 A051568 A051569 * A051571 A051572 A051573

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

I am not certain this description is correct, nor how rigorous the results are.

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 5 13:26 EST 2019. Contains 329751 sequences. (Running on oeis4.)