A339645 - cp's OEIS frontend

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.

n	a(n)
1	1
2	1
3	1
4	2
5	3
6	2
7	5
8	17
9	12
10	5
11	12
12	73
13	95
14	44
15	12
16	33
17	369
18	721
19	512
20	168
21	33
22	90
23	1795
24	5487
25	5480
26	2556
27	625
28	90
29	261
30	9192
31	41945
32	58990
33	36711
34	12306
35	2342
36	261
37	766
38	47324
39	321951
40	625088
41	516952
42	224241
43	57155
44	8702
45	766
46	2312
47	249164
48	2483192
49	6593103
50	7141755
51	3965673
52	1283624
53	258887
54	32313
55	2312

[1, 1, 1, 2, 3, 2, 5, 17, 12, 5, 12, 73, 95, 44, 12, 33, 369, 721, 512, 168, 33, 90, 1795, 5487, 5480, 2556, 625, 90, 261, 9192, 41945, 58990, 36711, 12306, 2342, 261, 766, 47324, 321951, 625088, 516952, 224241, 57155, 8702, 766, 2312, 249164, 2483192, 6593103, 7141755, 3965673, 1283624, 258887, 32313, 2312]

cp's OEIS Frontend

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.

Table of values

List of values