A079268 - cp's OEIS frontend

A079268 Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.

n	a(n)
1	1
2	1
3	1
4	1
5	3
6	3
7	1
8	7
9	15
10	15
11	1
12	15
13	57
14	105
15	105
16	1
17	31
18	195
19	561
20	945
21	945
22	1
23	63
24	633
25	2685
26	6555
27	10395
28	10395
29	1
30	127
31	1995
32	12105
33	40725
34	89055
35	135135
36	135135
37	1
38	255
39	6177
40	52605
41	237555
42	684495
43	1381905
44	2027025
45	2027025
46	1
47	511
48	18915
49	223161

[1, 1, 1, 1, 3, 3, 1, 7, 15, 15, 1, 15, 57, 105, 105, 1, 31, 195, 561, 945, 945, 1, 63, 633, 2685, 6555, 10395, 10395, 1, 127, 1995, 12105, 40725, 89055, 135135, 135135, 1, 255, 6177, 52605, 237555, 684495, 1381905, 2027025, 2027025, 1, 511, 18915, 223161]

cp's OEIS Frontend

A079268 Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.

Table of values

List of values