A244530 - cp's OEIS frontend

A244530 Number T(n,k) of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	1
7	0
8	4
9	0
10	1
11	0
12	11
13	2
14	0
15	1
16	0
17	36
18	5
19	0
20	0
21	1
22	0
23	117
24	11
25	3
26	0
27	0
28	1
29	0
30	393
31	28
32	7
33	0
34	0
35	0
36	1
37	0
38	1339
39	78
40	8
41	4
42	0
43	0
44	0
45	1
46	0
47	4630
48	201
49	21
50	9
51	0
52	0
53	0
54	0
55	1
56	0
57	16193
58	532
59	55
60	10
61	5
62	0
63	0
64	0
65	0
66	1
67	0
68	57201
69	1441
70	121
71	11
72	11
73	0
74	0
75	0
76	0
77	0
78	1

[1, 0, 1, 0, 1, 1, 0, 4, 0, 1, 0, 11, 2, 0, 1, 0, 36, 5, 0, 0, 1, 0, 117, 11, 3, 0, 0, 1, 0, 393, 28, 7, 0, 0, 0, 1, 0, 1339, 78, 8, 4, 0, 0, 0, 1, 0, 4630, 201, 21, 9, 0, 0, 0, 0, 1, 0, 16193, 532, 55, 10, 5, 0, 0, 0, 0, 1, 0, 57201, 1441, 121, 11, 11, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A244530 Number T(n,k) of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.

Table of values

List of values