A101401 - cp's OEIS frontend

A101401 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.

n	a(n)
1	1
2	1
3	2
4	3
5	6
6	3
7	12
8	24
9	15
10	4
11	55
12	110
13	75
14	28
15	5
16	273
17	546
18	390
19	168
20	45
21	6
22	1428
23	2856
24	2100
25	980
26	315
27	66
28	7
29	7752
30	15504
31	11628
32	5712
33	2040
34	528
35	91
36	8
37	43263
38	86526
39	65835
40	33516
41	12825
42	3762
43	819
44	120
45	9
46	246675
47	493350
48	379500
49	198352
50	79695
51	25410
52	6370
53	1200
54	153
55	10

[1, 1, 2, 3, 6, 3, 12, 24, 15, 4, 55, 110, 75, 28, 5, 273, 546, 390, 168, 45, 6, 1428, 2856, 2100, 980, 315, 66, 7, 7752, 15504, 11628, 5712, 2040, 528, 91, 8, 43263, 86526, 65835, 33516, 12825, 3762, 819, 120, 9, 246675, 493350, 379500, 198352, 79695, 25410, 6370, 1200, 153, 10]

cp's OEIS Frontend

A101401 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.

Table of values

List of values