Triangle read by rows: T(n,k) is the number of inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors.

A339645

Triangle read by rows: T(n,k) is the number of inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =2a(6) =5a(7) =17a(8) =12a(9) =5a(10) =12a(11) =73a(12) =95a(13) =44a(14) =12a(15) =33a(16) =369a(17) =721a(18) =512a(19) =168a(20) =33a(21) =90a(22) =1795a(23) =5487a(24) =5480a(25) =2556a(26) =625a(27) =90a(28) =261a(29) =9192

External references