A102595 - cp's OEIS frontend

A102595 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.

n	a(n)
0	1
1	0
2	1
3	0
4	0
5	3
6	1
7	4
8	3
9	4
10	7
11	20
12	15
13	8
14	5
15	42
16	102
17	72
18	36
19	15
20	6
21	245
22	540
23	366
24	176
25	70
26	24
27	7
28	1428
29	2950
30	1944
31	912
32	355
33	120
34	35
35	8
36	8379
37	16524
38	10668
39	4920
40	1890
41	636
42	189
43	48
44	9
45	49588
46	94430
47	60021
48	27336
49	10405
50	3492
51	1050
52	280
53	63
54	10
55	296010

[1, 0, 1, 0, 0, 3, 1, 4, 3, 4, 7, 20, 15, 8, 5, 42, 102, 72, 36, 15, 6, 245, 540, 366, 176, 70, 24, 7, 1428, 2950, 1944, 912, 355, 120, 35, 8, 8379, 16524, 10668, 4920, 1890, 636, 189, 48, 9, 49588, 94430, 60021, 27336, 10405, 3492, 1050, 280, 63, 10, 296010]

cp's OEIS Frontend

A102595 Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.

Table of values

List of values