id:A035288 - OEIS Search Results

Search: id:A035288

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 8, 52, 184, 480, 1040, 1988, 3472, 5664, 8760, 12980, 18568, 25792, 34944, 46340, 60320, 77248, 97512, 121524, 149720, 182560, 220528, 264132, 313904, 370400, 434200, 505908, 586152, 675584, 774880, 884740, 1005888, 1139072, 1285064 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) = (3 n^4 - 4 n^3 + 3 n^2 - 2 n)/3`
	EXAMPLE	`There are 52 ways of putting 2 distinct bishops on 3 X 3 so that neither can capture the other`
	CROSSREFS	`Sequence in context: A014829 A048438 A013521 this_sequence A024179 A026963 A026973` `Adjacent sequences: A035285 A035286 A035287 this_sequence A035289 A035290 A035291`
	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