A339650 - cp's OEIS frontend

A339650 Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	1
8	2
9	1
10	0
11	1
12	4
13	6
14	3
15	0
16	1
17	10
18	30
19	36
20	15
21	0
22	2
23	27
24	140
25	310
26	300
27	105
28	0
29	2
30	74
31	663
32	2376
33	3990
34	3150
35	945
36	0
37	4
38	226
39	3186
40	17304
41	44850
42	59805
43	39690
44	10395
45	0
46	6
47	710
48	15642
49	123508
50	462735
51	925890
52	1018710
53	582120
54	135135

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 4, 6, 3, 0, 1, 10, 30, 36, 15, 0, 2, 27, 140, 310, 300, 105, 0, 2, 74, 663, 2376, 3990, 3150, 945, 0, 4, 226, 3186, 17304, 44850, 59805, 39690, 10395, 0, 6, 710, 15642, 123508, 462735, 925890, 1018710, 582120, 135135]

cp's OEIS Frontend

A339650 Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3.

Table of values

List of values