A330763 - cp's OEIS frontend

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.

n	a(n)
1	1
2	1
3	2
4	2
5	8
6	8
7	5
8	41
9	90
10	58
11	12
12	204
13	852
14	1264
15	612
16	33
17	1046
18	7428
19	19568
20	21510
21	8374
22	90
23	5456
24	62682
25	262912
26	496270
27	431040
28	140408
29	261
30	29165
31	523167
32	3291021
33	9520220
34	13884960
35	9947294
36	2785906
37	766
38	158792
39	4358182
40	39636784
41	165204730
42	360421716
43	426677440
44	259854304
45	63830764

[1, 1, 2, 2, 8, 8, 5, 41, 90, 58, 12, 204, 852, 1264, 612, 33, 1046, 7428, 19568, 21510, 8374, 90, 5456, 62682, 262912, 496270, 431040, 140408, 261, 29165, 523167, 3291021, 9520220, 13884960, 9947294, 2785906, 766, 158792, 4358182, 39636784, 165204730, 360421716, 426677440, 259854304, 63830764]

cp's OEIS Frontend

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.

Table of values

List of values