A051571 - OEIS

This site is supported by donations to The OEIS Foundation.

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.

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 A156356 A143640` `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`

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

Last modified May 25 05:52 EDT 2013. Contains 225644 sequences.