Triangle read by rows: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves using exactly k colors.

A339780

Triangle read by rows: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves using exactly k colors.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =2a(9) =1a(10) =0a(11) =2a(12) =7a(13) =9a(14) =4a(15) =0a(16) =3a(17) =24a(18) =63a(19) =68a(20) =26a(21) =0a(22) =7a(23) =91a(24) =412a(25) =812a(26) =720a(27) =236a(28) =0a(29) =13

External references