id:A035289 - OEIS Search Results

Search: id:A035289

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 12, 56, 192, 504, 1100, 2112, 3696, 6032, 9324, 13800, 19712, 27336, 36972, 48944, 63600, 81312, 102476, 127512, 156864, 191000, 230412, 275616, 327152, 385584, 451500, 525512, 608256, 700392, 802604, 915600, 1040112, 1176896 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) = n^4 - 9 n^2 + 24 n - 16`
	EXAMPLE	`There are 56 ways of putting 2 distinct knights on 3 X 3 so that neither can capture the other`
	CROSSREFS	`Sequence in context: A001386 A046998 A009430 this_sequence A009827 A068418 A068414` `Adjacent sequences: A035286 A035287 A035288 this_sequence A035290 A035291 A035292`
	KEYWORD	`nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research