A071210 - cp's OEIS frontend

A071210 Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.

n	a(n)
1	1
2	3
3	1
4	18
5	8
6	1
7	160
8	80
9	15
10	1
11	1875
12	1000
13	225
14	24
15	1
16	27216
17	15120
18	3780
19	504
20	35
21	1
22	470596
23	268912
24	72030
25	10976
26	980
27	48
28	1
29	9437184
30	5505024
31	1548288
32	258048
33	26880
34	1728
35	63
36	1
37	215233605
38	127545840
39	37200870
40	6613488
41	765450
42	58320

[1, 3, 1, 18, 8, 1, 160, 80, 15, 1, 1875, 1000, 225, 24, 1, 27216, 15120, 3780, 504, 35, 1, 470596, 268912, 72030, 10976, 980, 48, 1, 9437184, 5505024, 1548288, 258048, 26880, 1728, 63, 1, 215233605, 127545840, 37200870, 6613488, 765450, 58320]

cp's OEIS Frontend

A071210 Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.

Table of values

List of values