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).

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).

Terms

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

External references