A214568 - cp's OEIS frontend

A214568 Triangle read by rows: T(n,k) is the number of rooted trees t with n vertices yielding k distinct rooted trees with n+1 vertices when a pendant edge is added to a vertex of t (1 <= k <= n).

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	1
7	0
8	1
9	1
10	2
11	0
12	1
13	2
14	3
15	3
16	0
17	1
18	1
19	6
20	6
21	6
22	0
23	1
24	3
25	7
26	11
27	14
28	12
29	0
30	1
31	1
32	11
33	16
34	29
35	32
36	25
37	0
38	1
39	3
40	11
41	26
42	46
43	72
44	75
45	52
46	0
47	1
48	2
49	16
50	27
51	79
52	122
53	182
54	177
55	113
56	0
57	1
58	3
59	18
60	42
61	101
62	217
63	336
64	457
65	420
66	247
67	0
68	1
69	1
70	20
71	47
72	149
73	303
74	621
75	911
76	1160
77	1005
78	548

[1, 0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 2, 3, 3, 0, 1, 1, 6, 6, 6, 0, 1, 3, 7, 11, 14, 12, 0, 1, 1, 11, 16, 29, 32, 25, 0, 1, 3, 11, 26, 46, 72, 75, 52, 0, 1, 2, 16, 27, 79, 122, 182, 177, 113, 0, 1, 3, 18, 42, 101, 217, 336, 457, 420, 247, 0, 1, 1, 20, 47, 149, 303, 621, 911, 1160, 1005, 548]

cp's OEIS Frontend

A214568 Triangle read by rows: T(n,k) is the number of rooted trees t with n vertices yielding k distinct rooted trees with n+1 vertices when a pendant edge is added to a vertex of t (1 <= k <= n).

Table of values

List of values