

A058527


Number of 2n X 2n 01 matrices with n ones in each row and each column.


3




OFFSET

0,2


COMMENTS

A diagonal of triangle in A008300.


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).
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/s1108301192411.
M. A. Khojastepour, M. FarajzadehTehrani, Characterizing per Node Degrees of Freedom in an Interference Network, 2014.
B. D. McKay, 01 matrices with constant row and column sums
Wikipedia, Dynamic programming


CROSSREFS

Cf. A001499, A001501, A253316.
Cf. A008300.
Sequence in context: A212301 A226339 A157064 * A138583 A193747 A242176
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, Feb 08 2001
More terms from Vladeta Jovovic, Nov 12 2006


STATUS

approved



