A071209 - cp's OEIS frontend

A071209 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 size k of the subtree rooted at the vertex labeled by 1.

n	a(n)
1	0
2	1
3	1
4	0
5	3
6	8
7	3
8	0
9	16
10	81
11	32
12	18
13	0
14	125
15	1024
16	405
17	240
18	160
19	0
20	1296
21	15625
22	6144
23	3645
24	2560
25	1875
26	0
27	16807
28	279936
29	109375
30	64512
31	45360
32	35000
33	27216
34	0
35	262144
36	5764801
37	2239488
38	1312500
39	917504
40	708750
41	580608
42	470596
43	0
44	4782969

[0, 1, 1, 0, 3, 8, 3, 0, 16, 81, 32, 18, 0, 125, 1024, 405, 240, 160, 0, 1296, 15625, 6144, 3645, 2560, 1875, 0, 16807, 279936, 109375, 64512, 45360, 35000, 27216, 0, 262144, 5764801, 2239488, 1312500, 917504, 708750, 580608, 470596, 0, 4782969]

cp's OEIS Frontend

A071209 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 size k of the subtree rooted at the vertex labeled by 1.

Table of values

List of values