A318758 - cp's OEIS frontend

A318758 Number T(n,k) of rooted trees with n nodes such that k equals the maximal number of isomorphic subtrees extending from the same node; 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	2
9	1
10	1
11	0
12	3
13	4
14	1
15	1
16	0
17	6
18	9
19	3
20	1
21	1
22	0
23	12
24	22
25	9
26	3
27	1
28	1
29	0
30	25
31	54
32	23
33	8
34	3
35	1
36	1
37	0
38	52
39	138
40	60
41	23
42	8
43	3
44	1
45	1
46	0
47	113
48	346
49	164
50	61
51	22
52	8
53	3
54	1
55	1
56	0
57	247
58	889
59	443
60	167
61	61
62	22
63	8
64	3
65	1
66	1
67	0
68	548
69	2285
70	1209
71	461
72	168
73	60
74	22
75	8
76	3
77	1
78	1

[1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 3, 4, 1, 1, 0, 6, 9, 3, 1, 1, 0, 12, 22, 9, 3, 1, 1, 0, 25, 54, 23, 8, 3, 1, 1, 0, 52, 138, 60, 23, 8, 3, 1, 1, 0, 113, 346, 164, 61, 22, 8, 3, 1, 1, 0, 247, 889, 443, 167, 61, 22, 8, 3, 1, 1, 0, 548, 2285, 1209, 461, 168, 60, 22, 8, 3, 1, 1]

cp's OEIS Frontend

A318758 Number T(n,k) of rooted trees with n nodes such that k equals the maximal number of isomorphic subtrees extending from the same node; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.

Table of values

List of values