id:A035290 - OEIS Search Results

Search: id:A035290

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 6, 50, 194, 522, 1142, 2186, 3810, 6194, 9542, 14082, 20066, 27770, 37494, 49562, 64322, 82146, 103430, 128594, 158082, 192362, 231926, 277290, 328994, 387602, 453702, 527906, 610850, 703194, 805622, 918842, 1043586, 1180610 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a(n) = n^4 - 4 n^3 + n^2 + 10 n - 6`
	EXAMPLE	`There are 6 ways of putting 1 white and 1 black pawn on 3 X 3 so that neither can capture the other. pawns can't be on first or last rank.`
	CROSSREFS	`Adjacent sequences: A035287 A035288 A035289 this_sequence A035291 A035292 A035293` `Sequence in context: A046195 A024268 A062801 this_sequence A138422 A001303 A027330`
	KEYWORD	`nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research