A061356 - cp's OEIS frontend

A061356 Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).

n	a(n)
2	1
3	2
4	1
5	9
6	6
7	1
8	64
9	48
10	12
11	1
12	625
13	500
14	150
15	20
16	1
17	7776
18	6480
19	2160
20	360
21	30
22	1
23	117649
24	100842
25	36015
26	6860
27	735
28	42
29	1
30	2097152
31	1835008
32	688128
33	143360
34	17920
35	1344
36	56
37	1
38	43046721
39	38263752
40	14880348
41	3306744
42	459270
43	40824
44	2268
45	72
46	1

[1, 2, 1, 9, 6, 1, 64, 48, 12, 1, 625, 500, 150, 20, 1, 7776, 6480, 2160, 360, 30, 1, 117649, 100842, 36015, 6860, 735, 42, 1, 2097152, 1835008, 688128, 143360, 17920, 1344, 56, 1, 43046721, 38263752, 14880348, 3306744, 459270, 40824, 2268, 72, 1]

cp's OEIS Frontend

A061356 Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).

Table of values

List of values