Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1).

Terms

a(0) =1a(1) =2a(2) =1a(3) =9a(4) =10a(5) =3a(6) =64a(7) =113a(8) =70a(9) =15a(10) =625a(11) =1526a(12) =1450a(13) =630a(14) =105a(15) =7776a(16) =24337a(17) =31346a(18) =20650a(19) =6930a(20) =945a(21) =117649a(22) =450066a(23) =733845a(24) =650188a(25) =329175a(26) =90090a(27) =10395a(28) =2097152a(29) =9492289