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 #9 Dec 31 2015 06:28:43
%S 0,0,4,12,1708,159860,171320524,365118796448
%N Number of n X n (0,1)-matrices such that the row sums are all different from the column sums.
%C The ratio a(n)/2^(n^2) tends to 0 as n grows.
%H Mathoverflow, <a href="http://mathoverflow.net/questions/227298/a-partition-of-the-set-of-all-n-times-n-0-1-matrices">A partition of the set of all n x n (0,1)-matrices</a>, 2015.
%F a(n) = 2^(n^2) - A266501(n).
%K nonn,hard,more
%O 0,3
%A _Max Alekseyev_, Dec 30 2015
%E a(6)-a(7) from _Hiroaki Yamanouchi_, Dec 31 2015