Triangle read by rows: T(n,k) is the number of series-reduced rooted trees whose leaves are sets of colors with a total of n elements using exactly k colors.

A330763

Triangle read by rows: T(n,k) is the number of series-reduced rooted trees whose leaves are sets of colors with a total of n elements using exactly k colors.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =2a(4) =8a(5) =8a(6) =5a(7) =41a(8) =90a(9) =58a(10) =12a(11) =204a(12) =852a(13) =1264a(14) =612a(15) =33a(16) =1046a(17) =7428a(18) =19568a(19) =21510a(20) =8374a(21) =90a(22) =5456a(23) =62682a(24) =262912a(25) =496270a(26) =431040a(27) =140408a(28) =261a(29) =29165

External references