id:A146304 - OEIS Search Results

Search: id:A146304

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

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

	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: A104363 A092190 A124724 this_sequence A152397 A059919 A143047` `Adjacent sequences: A146301 A146302 A146303 this_sequence A146305 A146306 A146307`
	KEYWORD	`hard,nonn`
	AUTHOR	`Paolo Bonzini (bonzini(AT)gnu.org), Oct 29 2008`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research