id:A051223 - OEIS Search Results

Search: id:A051223

Displaying 1-1 of 1 results found.

page 1

Number of ways of placing n nonattacking superqueens on an n X n board.

+0
4

1, 0, 0, 0, 0, 0, 0, 0, 0, 4, 44, 156, 1876, 5180, 32516, 202900, 1330622, 8924976, 64492432, 495864256, 3977841852, 34092182276, 306819842212 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`A superqueen moves like a queen and a knight.` `A linear time algorithm giving an explicit solution for any n >= 10 for the n-super-queens-problem can be found at the link. Included is an online solver, implemented in Javascript. - Frank Schwellinger (nummer_eins(AT)web.de), Mar 19 2004`
	LINKS	`Anonymous, N x N SuperQueens Solutions Table` `D. Bill, Durango Bill's The N-Queens Problem` `F. Schwellinger, Explicit Solution To the N-Super-Queens Problem.`
	CROSSREFS	`Cf. A051224, A000170.` `Sequence in context: A102388 A071125 A053314 this_sequence A077435 A074751 A129551` `Adjacent sequences: A051220 A051221 A051222 this_sequence A051224 A051225 A051226`
	KEYWORD	`nonn,more`
	AUTHOR	`Ulrich Schimke (ulrschimke(AT)aol.com)`
	EXTENSIONS	`a(20) from Bill link added Jul 25 2006` `Three further terms supplied by Max Alekseyev from the "Anonymous" link.`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research