A146304 - OEIS

This site is supported by donations to The OEIS Foundation.

A146304

Number of distinct ways to place bishops (up to 2n-2) on a n*n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.

1, 4, 10, 64, 660, 7744, 111888, 1960000, 40829184 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	FORMULA	`Conjectured to be a(n)=O(n^(n-1).`
	EXAMPLE	`For n=2, the a(n) = 4 solutions are to place two bishops on the same row (two solutions) or column (two solutions).`
	CROSSREFS	`Cf. A146303` `Sequence in context: A092190 A124724 A203226 * A189893 A197939 A152397` `Adjacent sequences: A146301 A146302 A146303 * A146305 A146306 A146307`
	KEYWORD	`hard,nonn`
	AUTHOR	`Paolo Bonzini (bonzini(AT)gnu.org), Oct 29 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 09:47 EST 2012. Contains 205762 sequences.