A380363 - cp's OEIS frontend

A380363 Triangle read by rows: T(n,k) is the number of linear trees with n vertices and k vertices of degree >= 3, 0 <= k <= max(0, floor(n/2)-1).

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	2
8	1
9	4
10	1
11	1
12	7
13	3
14	1
15	11
16	10
17	1
18	1
19	17
20	24
21	5
22	1
23	25
24	56
25	22
26	1
27	1
28	36
29	114
30	74
31	6
32	1
33	50
34	224
35	219
36	37
37	1
38	1
39	70
40	411
41	576
42	158
43	8
44	1
45	94
46	733
47	1394
48	591
49	58
50	1
51	1
52	127
53	1252
54	3150
55	1896
56	304
57	9
58	1
59	168
60	2091
61	6733
62	5537
63	1342
64	82
65	1

[1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 7, 3, 1, 11, 10, 1, 1, 17, 24, 5, 1, 25, 56, 22, 1, 1, 36, 114, 74, 6, 1, 50, 224, 219, 37, 1, 1, 70, 411, 576, 158, 8, 1, 94, 733, 1394, 591, 58, 1, 1, 127, 1252, 3150, 1896, 304, 9, 1, 168, 2091, 6733, 5537, 1342, 82, 1]

cp's OEIS Frontend

A380363 Triangle read by rows: T(n,k) is the number of linear trees with n vertices and k vertices of degree >= 3, 0 <= k <= max(0, floor(n/2)-1).

Table of values

List of values