Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).
A048159
Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).
Terms
- a(0) =1a(1) =3a(2) =1a(3) =16a(4) =13a(5) =3a(6) =125a(7) =171a(8) =85a(9) =15a(10) =1296a(11) =2551a(12) =2005a(13) =735a(14) =105a(15) =16807a(16) =43653a(17) =47586a(18) =26950a(19) =7875a(20) =945a(21) =262144a(22) =850809a(23) =1195383a(24) =924238a(25) =412650a(26) =100485a(27) =10395a(28) =4782969a(29) =18689527
External references
- oeis: A048159