A336255 - cp's OEIS frontend

A336255 Irregular triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes with path length exactly k, n>=1, 0<=k<=C(n,2).

n	a(n)
1	1
2	0
3	2
4	0
5	0
6	3
7	6
8	0
9	0
10	0
11	4
12	24
13	12
14	24
15	0
16	0
17	0
18	0
19	5
20	60
21	120
22	140
23	120
24	60
25	120
26	0
27	0
28	0
29	0
30	0
31	6
32	120
33	540
34	840
35	1470
36	720
37	1440
38	840
39	720
40	360
41	720
42	0
43	0
44	0
45	0
46	0
47	0
48	7
49	210
50	1680
51	4620
52	9240
53	11382
54	13440
55	14700
56	10920
57	12810
58	10080
59	10080
60	5880
61	5040
62	2520
63	5040

[1, 0, 2, 0, 0, 3, 6, 0, 0, 0, 4, 24, 12, 24, 0, 0, 0, 0, 5, 60, 120, 140, 120, 60, 120, 0, 0, 0, 0, 0, 6, 120, 540, 840, 1470, 720, 1440, 840, 720, 360, 720, 0, 0, 0, 0, 0, 0, 7, 210, 1680, 4620, 9240, 11382, 13440, 14700, 10920, 12810, 10080, 10080, 5880, 5040, 2520, 5040]

cp's OEIS Frontend

A336255 Irregular triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes with path length exactly k, n>=1, 0<=k<=C(n,2).

Table of values

List of values