Irregular triangle read by rows where T(n,k) is the number of (d + 1)-uniform hypertrees spanning n + 1 vertices, where d = A027750(n,k).

A326374

Irregular triangle read by rows where T(n,k) is the number of (d + 1)-uniform hypertrees spanning n + 1 vertices, where d = A027750(n,k).

Terms

    a(0) =1a(1) =3a(2) =1a(3) =16a(4) =1a(5) =125a(6) =15a(7) =1a(8) =1296a(9) =1a(10) =16807a(11) =735a(12) =140a(13) =1a(14) =262144a(15) =1a(16) =4782969a(17) =76545a(18) =1890a(19) =1a(20) =100000000a(21) =112000a(22) =1a(23) =2357947691a(24) =13835745a(25) =33264a(26) =1a(27) =61917364224a(28) =1a(30) =3859590735

External references