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

A059084

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =0a(6) =2a(7) =5a(8) =4a(9) =1a(10) =0a(11) =0a(12) =12a(13) =44a(14) =67a(15) =56a(16) =28a(17) =8a(18) =1a(19) =0a(20) =0a(21) =12a(22) =268a(23) =1411a(24) =4032a(25) =7840a(26) =11392a(27) =12864a(28) =11440a(29) =8008

External references