A122087 - cp's OEIS frontend

A122087 Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= floor(n/2), except k = 0 if n = 1 ) nodes of one color and n-k nodes of the other color (the colors are interchangeable).

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	2
8	1
9	2
10	3
11	1
12	3
13	7
14	1
15	3
16	10
17	9
18	1
19	4
20	14
21	28
22	1
23	4
24	19
25	45
26	37
27	1
28	5
29	24
30	73
31	132
32	1
33	5
34	30
35	105
36	242
37	168
38	1
39	6
40	37
41	152
42	412
43	693
44	1
45	6
46	44
47	204
48	660
49	1349
50	895
51	1
52	7
53	52
54	274
55	1008
56	2472
57	3927
58	1
59	7
60	61
61	351
62	1479
63	4219
64	8105
65	5097
66	1
67	8

[1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 3, 7, 1, 3, 10, 9, 1, 4, 14, 28, 1, 4, 19, 45, 37, 1, 5, 24, 73, 132, 1, 5, 30, 105, 242, 168, 1, 6, 37, 152, 412, 693, 1, 6, 44, 204, 660, 1349, 895, 1, 7, 52, 274, 1008, 2472, 3927, 1, 7, 61, 351, 1479, 4219, 8105, 5097, 1, 8]

cp's OEIS Frontend

A122087 Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= floor(n/2), except k = 0 if n = 1 ) nodes of one color and n-k nodes of the other color (the colors are interchangeable).

Table of values

List of values