Number of proper T_1-hypergraphs with 3 labeled nodes and n hyperedges.

Terms

a(0) =0a(1) =0a(2) =2a(3) =15a(4) =54a(5) =141a(6) =306a(7) =588a(8) =1036a(9) =1710a(10) =2682a(11) =4037a(12) =5874a(13) =8307a(14) =11466a(15) =15498a(16) =20568a(17) =26860a(18) =34578a(19) =43947a(20) =55214a(21) =68649a(22) =84546a(23) =103224a(24) =125028a(25) =150330a(26) =179530a(27) =213057a(28) =251370a(29) =294959