A102593 - cp's OEIS frontend

A102593 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximum number of contiguous border edges starting from the root in counterclockwise direction is equal to k.

n	a(n)
0	1
1	0
2	1
3	1
4	1
5	1
6	5
7	4
8	2
9	1
10	25
11	18
12	8
13	3
14	1
15	130
16	88
17	37
18	13
19	4
20	1
21	700
22	455
23	185
24	63
25	19
26	5
27	1
28	3876
29	2448
30	973
31	325
32	97
33	26
34	6
35	1
36	21945
37	13566
38	5304
39	1748
40	518
41	140
42	34
43	7
44	1
45	126500
46	76912
47	29697
48	9690
49	2856
50	775
51	193
52	43
53	8
54	1
55	740025
56	444015
57	169763
58	54967

[1, 0, 1, 1, 1, 1, 5, 4, 2, 1, 25, 18, 8, 3, 1, 130, 88, 37, 13, 4, 1, 700, 455, 185, 63, 19, 5, 1, 3876, 2448, 973, 325, 97, 26, 6, 1, 21945, 13566, 5304, 1748, 518, 140, 34, 7, 1, 126500, 76912, 29697, 9690, 2856, 775, 193, 43, 8, 1, 740025, 444015, 169763, 54967]

cp's OEIS Frontend

A102593 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximum number of contiguous border edges starting from the root in counterclockwise direction is equal to k.

Table of values

List of values