Triangle read by rows: T(n,k) is the number of forests of labeled rooted Greg hypertrees with n white vertices and k black vertices, 0 <= k < n.

A370949

Triangle read by rows: T(n,k) is the number of forests of labeled rooted Greg hypertrees with n white vertices and k black vertices, 0 <= k < n.

Terms

    a(0) =1a(1) =3a(2) =1a(3) =19a(4) =16a(5) =3a(6) =189a(7) =268a(8) =115a(9) =15a(10) =2576a(11) =5221a(12) =3655a(13) =1050a(14) =105a(15) =44683a(16) =118599a(17) =117236a(18) =54040a(19) =11655a(20) =945a(21) =941977a(22) =3102184a(23) =3996384a(24) =2581138a(25) =883575a(26) =152460a(27) =10395a(28) =23388025a(29) =92149019

External references