id:A035286 - OEIS Search Results

Search: id:A035286

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 32, 156, 456, 1040, 2040, 3612, 5936, 9216, 13680, 19580, 27192, 36816, 48776, 63420, 81120, 102272, 127296, 156636, 190760, 230160, 275352, 326876, 385296, 451200, 525200, 607932, 700056, 802256, 915240, 1039740, 1176512, 1326336 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) = n^4 - 9 n^2 + 12 n - 4`
	EXAMPLE	`There are 32 ways of putting 2 distinct kings on 3 X 3 so that neither can capture the other`
	CROSSREFS	`Sequence in context: A100172 A124998 A126419 this_sequence A029534 A120046 A019560` `Adjacent sequences: A035283 A035284 A035285 this_sequence A035287 A035288 A035289`
	KEYWORD	`nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research