A244454 - cp's OEIS frontend

A244454 Number T(n,k) of 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	3
9	0
10	1
11	0
12	7
13	1
14	0
15	1
16	0
17	17
18	2
19	0
20	0
21	1
22	0
23	42
24	4
25	1
26	0
27	0
28	1
29	0
30	105
31	7
32	2
33	0
34	0
35	0
36	1
37	0
38	267
39	15
40	2
41	1
42	0
43	0
44	0
45	1
46	0
47	684
48	28
49	4
50	2
51	0
52	0
53	0
54	0
55	1
56	0
57	1775
58	56
59	7
60	2
61	1
62	0
63	0
64	0
65	0
66	1
67	0
68	4639
69	110
70	12
71	2
72	2
73	0
74	0
75	0
76	0
77	0
78	1

[1, 0, 1, 0, 1, 1, 0, 3, 0, 1, 0, 7, 1, 0, 1, 0, 17, 2, 0, 0, 1, 0, 42, 4, 1, 0, 0, 1, 0, 105, 7, 2, 0, 0, 0, 1, 0, 267, 15, 2, 1, 0, 0, 0, 1, 0, 684, 28, 4, 2, 0, 0, 0, 0, 1, 0, 1775, 56, 7, 2, 1, 0, 0, 0, 0, 1, 0, 4639, 110, 12, 2, 2, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A244454 Number T(n,k) of 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