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 #11 Jan 31 2020 14:32:09
%S 1,1,3,29,666,28344,1935054,193926796,26892165502,4946464286746,
%T 1168900475263013,346080409272270888,125798338606148948325,
%U 55204084562033205121607,28834556615453989801860765,17710828268156331289770544579,12658784968736373972502731143309
%N Number of binary matrices with n distinct columns and any number of nonzero rows with 3 ones in every column and rows in nonincreasing lexicographic order.
%C The condition that the rows be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of rows.
%C a(n) is the number of T_0 3-regular set multipartitions (multisets of sets) on an n-set.
%H Andrew Howroyd, <a href="/A331389/b331389.txt">Table of n, a(n) for n = 0..100</a>
%F a(n) = Sum_{k=0..n} Stirling1(n,k)*A165434(k). - _Andrew Howroyd_, Jan 31 2020
%e The a(2) = 3 matrices are:
%e [1 0] [1 1] [1 1]
%e [1 0] [1 0] [1 1]
%e [1 0] [1 0] [1 0]
%e [0 1] [0 1] [0 1]
%e [0 1] [0 1]
%e [0 1]
%Y Row n=3 of A331126.
%Y Cf. A165434.
%K nonn
%O 0,3
%A _Andrew Howroyd_, Jan 15 2020