Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge excluded), m=0,1,...,2^n-1.

A059087

Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge excluded), m=0,1,...,2^n-1.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =0a(4) =2a(5) =3a(6) =1a(7) =0a(8) =0a(9) =12a(10) =32a(11) =35a(12) =21a(13) =7a(14) =1a(15) =0a(16) =0a(17) =12a(18) =256a(19) =1155a(20) =2877a(21) =4963a(22) =6429a(23) =6435a(24) =5005a(25) =3003a(26) =1365a(27) =455a(28) =105a(29) =15

External references