id:A051571 - OEIS Search Results

Search: id:A051571

Displaying 1-1 of 1 results found.

page 1

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
13

0, 0, 0, 1, 3, 40, 615, 16573 (list; graph; listen)

	OFFSET	`3,5`
	REFERENCES	`M. Gardner, The Last Recreations, Springer, 1997, p. 282.`
	CROSSREFS	`Cf. A051567-A051570, A051754-A051759, A019654.` `Sequence in context: A002700 A005724 A093376 this_sequence A019654 A156356 A143640` `Adjacent sequences: A051568 A051569 A051570 this_sequence A051572 A051573 A051574`
	KEYWORD	`nonn,more`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Probably an incorrect version of A019654.`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research