Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Apr 11 2017 16:57:56
%S 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,355687428096000,
%T 3237415247416050491577971184000,
%U 13564406360915457771720399143711430952267776000,37911589613425952733393718264069147678877877626169022024515000
%N Number of n X n 0..1 arrays with row sums 16 and column sums 16.
%H Brendan D. McKay, <a href="/A172542/b172542.txt">Table of n, a(n) for n = 0..30</a> (terms n=1..20 from R. H. Hardin)
%H E. R. Canfield and B. D. McKay, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v12i1r29">Asymptotic enumeration of dense 0-1 matrices with equal row and column sums</a>
%H Shalosh B. Ekhad and Doron Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/bipartite.html">In How Many Ways Can n (Straight) Men and n (Straight) Women Get Married, if Each Person Has Exactly k Spouses</a>, Maple package Bipartite.
%H B. D. McKay, <a href="http://users.cecs.anu.edu.au/~bdm/data/semiregular.html">0-1 matrices with constant row and column sums</a>
%Y Column k=16 of A008300.
%K nonn
%O 0,18
%A _R. H. Hardin_, Feb 06 2010