

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




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. A051567A051571, A051754A051759, 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



