A271362 - cp's OEIS frontend

A271362 Number T(n,k) of series-reduced free trees with n nodes of which exactly k>=3 are leaves, k+1 <= n <= 2k-2.

n	a(n)
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	1
16	2
17	4
18	3
19	1
20	4
21	6
22	3
23	1
24	2
25	10
26	9
27	4
28	1
29	8
30	17
31	12
32	4
33	1
34	4
35	22
36	30
37	16
38	5
39	1
40	15
41	47
42	44
43	20
44	5
45	1
46	6
47	53
48	91
49	67
50	25
51	6
52	1
53	32
54	127
55	158
56	91
57	30
58	6
59	1
60	11
61	121
62	282
63	258
64	126

[1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 4, 3, 1, 4, 6, 3, 1, 2, 10, 9, 4, 1, 8, 17, 12, 4, 1, 4, 22, 30, 16, 5, 1, 15, 47, 44, 20, 5, 1, 6, 53, 91, 67, 25, 6, 1, 32, 127, 158, 91, 30, 6, 1, 11, 121, 282, 258, 126]

cp's OEIS Frontend

A271362 Number T(n,k) of series-reduced free trees with n nodes of which exactly k>=3 are leaves, k+1 <= n <= 2k-2.

Table of values

List of values

n	a(n)
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	1
16	2
17	4
18	3
19	1
20	4
21	6
22	3
23	1
24	2
25	10
26	9
27	4
28	1
29	8
30	17
31	12
32	4
33	1
34	4
35	22
36	30
37	16
38	5
39	1
40	15
41	47
42	44
43	20
44	5
45	1
46	6
47	53
48	91
49	67
50	25
51	6
52	1
53	32
54	127
55	158
56	91
57	30
58	6
59	1
60	11
61	121
62	282
63	258
64	126

n	a(n)
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	1
16	2
17	4
18	3
19	1
20	4
21	6
22	3
23	1
24	2
25	10
26	9
27	4
28	1
29	8
30	17
31	12
32	4
33	1
34	4
35	22
36	30
37	16
38	5
39	1
40	15
41	47
42	44
43	20
44	5
45	1
46	6
47	53
48	91
49	67
50	25
51	6
52	1
53	32
54	127
55	158
56	91
57	30
58	6
59	1
60	11
61	121
62	282
63	258
64	126

n	a(n)
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	1
16	2
17	4
18	3
19	1
20	4
21	6
22	3
23	1
24	2
25	10
26	9
27	4
28	1
29	8
30	17
31	12
32	4
33	1
34	4
35	22
36	30
37	16
38	5
39	1
40	15
41	47
42	44
43	20
44	5
45	1
46	6
47	53
48	91
49	67
50	25
51	6
52	1
53	32
54	127
55	158
56	91
57	30
58	6
59	1
60	11
61	121
62	282
63	258
64	126