A114502 - cp's OEIS frontend

A114502 Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2).

n	a(n)
1	1
2	2
3	5
4	13
5	1
6	34
7	8
8	89
9	42
10	1
11	233
12	183
13	13
14	610
15	717
16	102
17	1
18	1597
19	2622
20	624
21	19
22	4181
23	9134
24	3275
25	205
26	1
27	10946
28	30691
29	15473
30	1650
31	26
32	28657
33	100284
34	67684
35	11020
36	366
37	1
38	75025
39	320466
40	279106
41	64553
42	3716
43	34
44	196418
45	1005630
46	1098402
47	342867

[1, 2, 5, 13, 1, 34, 8, 89, 42, 1, 233, 183, 13, 610, 717, 102, 1, 1597, 2622, 624, 19, 4181, 9134, 3275, 205, 1, 10946, 30691, 15473, 1650, 26, 28657, 100284, 67684, 11020, 366, 1, 75025, 320466, 279106, 64553, 3716, 34, 196418, 1005630, 1098402, 342867]

cp's OEIS Frontend

A114502 Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2).

Table of values

List of values