A058527 - OEIS

This site is supported by donations to The OEIS Foundation.

A058527

Number of 2n X 2n 0-1 matrices with n ones in each row and each column.

1, 2, 90, 297200, 116963796250, 6736218287430460752, 64051375889927380035549804336, 108738182111446498614705217754614976371200 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	LINKS	`_Vladeta Jovovic_, Nov 12 2006, Table of n, a(n) for n = 0..15` `A Conflitti, C. M. Da Fonseca, R. Mamede, The maximal length of a chain in the Bruhat order for a chain of binary matrices., Lin. Algebra Applic. (2011)` `ALESSANDRO CONFLITTI, C. M. DA FONSECA AND RICARDO MAMEDE, On the largest size of an antichain in the Bruhat order for A(2k, k), http://www.mat.uc.pt/preprints/ps/pre1125.ps.` `Alessandro Conflitti, C. M. da Fonseca and Ricardo Mamede, On the Largest Size of an Antichain in the Bruhat Order for A(2k,k), ORDER, 2011, DOI: 10.1007/s11083-011-9241-1; http://www.springerlink.com/content/97618878447631j8/` `B. D. McKay, 0-1 matrices with constant row and column sums` `Wikipedia, Dynamic programming`
	CROSSREFS	`A diagonal of triangle in A008300. Cf. A001499, A001501.` `Sequence in context: A212301 A226339 A157064 * A138583 A193747 A024240` `Adjacent sequences: A058524 A058525 A058526 * A058528 A058529 A058530`
	KEYWORD	`nonn`
	AUTHOR	`David desJardins (david(AT)desjardins.org), Dec 22 2000`
	EXTENSIONS	`More terms (using dynamic programming in Python) from Greg Kuperberg (greg(AT)math.ucdavis.edu), Feb 08 2001` `More terms from Vladeta Jovovic, Nov 12 2006`
	STATUS	`approved`

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

Last modified June 19 16:16 EDT 2013. Contains 226414 sequences.