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 #7 Dec 06 2014 17:58:59
%S 0,0,1,1,2,7,16,71
%N Number of equivalent classes of n X n 0-1 matrices with 3 1's in each row and column.
%C Matrices are considered to belong to the same equivalent class if they can be transformed into each other by successive permutations of rows or columns.
%C In general, to transform 2 equivalent matrices into each other, it is necessary to first permute rows, then columns, then rows and so on.
%C From _Brendan McKay_, Aug 27 2010: (Start)
%C A079815 appears on the surface to describe the same objects as A000512, but I don't know where the term "71" comes from.
%C Also the comment "In general, to transform 2 equivalent matrices into each other, it is necessary to first permute rows, then columns, then rows and so on." is wrong - actually only one permutation of rows and one permutation of columns is enough.
%C I will guess that this sequence counts matrices in which both the rows and columns are in sorted order. The reason I suspect that is because a common way to make such matrices is to alternately sort the rows and columns until it stabilizes.
%C The value of a(8) should be checked. (End)
%e n=4: every matrix with 3 1's in each row and column can be transformed by permutation of rows (or columns) into {1110,1101,1011,0111}, therefore a(4)=1.
%Y Cf. A001501.
%K more,nonn,obsc
%O 1,5
%A Michael Steyer (m.steyer(AT)osram.de), Feb 20 2003
%E Edited by _N. J. A. Sloane_, Sep 04 2010