A363273 - cp's OEIS frontend

A363273 Irregular triangle read by rows: T(n,k) = number of unlabeled binary rooted trees with n leaves, where both children have at least k leaves, 1 <= k <= n/2.

n	a(n)
2	1
3	1
4	2
5	1
6	3
7	1
8	6
9	3
10	1
11	11
12	5
13	2
14	23
15	12
16	6
17	3
18	46
19	23
20	12
21	6
22	98
23	52
24	29
25	18
26	6
27	207
28	109
29	63
30	40
31	18
32	451
33	244
34	146
35	100
36	54
37	21
38	983
39	532
40	325
41	227
42	135
43	66
44	2179
45	1196
46	745
47	538
48	342
49	204
50	66
51	4850
52	2671
53	1688
54	1237
55	823
56	529
57	253
58	10905
59	6055
60	3876
61	2893
62	1991
63	1370
64	782
65	276

[1, 1, 2, 1, 3, 1, 6, 3, 1, 11, 5, 2, 23, 12, 6, 3, 46, 23, 12, 6, 98, 52, 29, 18, 6, 207, 109, 63, 40, 18, 451, 244, 146, 100, 54, 21, 983, 532, 325, 227, 135, 66, 2179, 1196, 745, 538, 342, 204, 66, 4850, 2671, 1688, 1237, 823, 529, 253, 10905, 6055, 3876, 2893, 1991, 1370, 782, 276]

cp's OEIS Frontend

A363273 Irregular triangle read by rows: T(n,k) = number of unlabeled binary rooted trees with n leaves, where both children have at least k leaves, 1 <= k <= n/2.

Table of values

List of values