A332961 - cp's OEIS frontend

A332961 Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having at most k nodes, (n>=1, 2<=k<=n+1).

n	a(n)
1	1
2	3
3	15
4	15
5	195
6	435
7	105
8	5145
9	11865
10	18865
11	945
12	152145
13	504945
14	819945
15	1092105
16	10395
17	6039495
18	27106695
19	47896695
20	65859255
21	79170399
22	135135
23	276351075
24	1663737075
25	3429501075
26	4900634739
27	6111948843
28	6899167275
29	2027025
30	14985795825
31	120931635825
32	286156695825
33	432180333585

[1, 3, 15, 15, 195, 435, 105, 5145, 11865, 18865, 945, 152145, 504945, 819945, 1092105, 10395, 6039495, 27106695, 47896695, 65859255, 79170399, 135135, 276351075, 1663737075, 3429501075, 4900634739, 6111948843, 6899167275, 2027025, 14985795825, 120931635825, 286156695825, 432180333585]

cp's OEIS Frontend

A332961 Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having at most k nodes, (n>=1, 2<=k<=n+1).

Table of values

List of values