Triangle T(n,m) of number of labeled m-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included), m=0,1,...,2^n.

A059584

Triangle T(n,m) of number of labeled m-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included), m=0,1,...,2^n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =1a(6) =3a(7) =7a(8) =12a(9) =12a(10) =1a(11) =4a(12) =16a(13) =68a(14) =292a(15) =1120a(16) =3360a(17) =6720a(18) =6720a(19) =1a(20) =5a(21) =30a(22) =235a(23) =2251a(24) =23520a(25) =245280a(26) =2412480a(27) =21631680a(28) =172972800a(29) =1210809600

External references