Triangle T(n,k) read by rows: T(n,k) is the number of unrooted hypertrees on n labeled vertices with k hyperedges, n >= 2, 1 <= k <= n-1.

A210587

Triangle T(n,k) read by rows: T(n,k) is the number of unrooted hypertrees on n labeled vertices with k hyperedges, n >= 2, 1 <= k <= n-1.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =12a(5) =16a(6) =1a(7) =35a(8) =150a(9) =125a(10) =1a(11) =90a(12) =900a(13) =2160a(14) =1296a(15) =1a(16) =217a(17) =4410a(18) =22295a(19) =36015a(20) =16807a(21) =1a(22) =504a(23) =19264a(24) =179200a(25) =573440a(26) =688128a(27) =262144a(28) =1a(29) =1143

External references