A071211 - cp's OEIS frontend

A071211 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 label k of the root.

n	a(n)
1	1
2	3
3	1
4	16
5	8
6	3
7	125
8	75
9	40
10	16
11	1296
12	864
13	540
14	300
15	125
16	16807
17	12005
18	8232
19	5292
20	3024
21	1296
22	262144
23	196608
24	143360
25	100352
26	65856
27	38416
28	16807
29	4782969
30	3720087
31	2834352
32	2099520
33	1492992
34	995328
35	589824
36	262144
37	100000000

[1, 3, 1, 16, 8, 3, 125, 75, 40, 16, 1296, 864, 540, 300, 125, 16807, 12005, 8232, 5292, 3024, 1296, 262144, 196608, 143360, 100352, 65856, 38416, 16807, 4782969, 3720087, 2834352, 2099520, 1492992, 995328, 589824, 262144, 100000000]

cp's OEIS Frontend

A071211 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 label k of the root.

Table of values

List of values