id:A035291 - OEIS Search Results

Search: id:A035291

Displaying 1-1 of 1 results found.

page 1

Number of ways to place a non-attacking white and black queen on n X n chessboard.

+0
2

0, 0, 16, 88, 280, 680, 1400, 2576, 4368, 6960, 10560, 15400, 21736, 29848, 40040, 52640, 68000, 86496, 108528, 134520, 164920, 200200, 240856, 287408, 340400, 400400, 468000, 543816, 628488, 722680, 827080, 942400, 1069376, 1208768 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) = (3 n^4 - 10 n^3 + 9 n^2 - 2 n)/3`
	EXAMPLE	`There are 16 ways of putting distinct queens on 3 X 3 so that neither can capture the other.`
	CROSSREFS	`Equals 4 * A052149(n-1).` `Sequence in context: A118675 A070052 A022676 this_sequence A120045 A119771 A055920` `Adjacent sequences: A035288 A035289 A035290 this_sequence A035292 A035293 A035294`
	KEYWORD	`nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research