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

A370948

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

Terms

    a(0) =1a(1) =3a(2) =1a(3) =22a(4) =15a(5) =1a(6) =262a(7) =271a(8) =53a(9) =1a(10) =4336a(11) =6020a(12) =2085a(13) =165a(14) =1a(15) =91984a(16) =160336a(17) =81310a(18) =13040a(19) =487a(20) =1a(21) =2381408a(22) =4996572a(23) =3364011a(24) =851690a(25) =73024a(26) =1407a(27) =1a(28) =72800928a(29) =178613156

External references