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 exactly k nodes, (n >= 1, 2 <= k <= n+1).
A332959
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 exactly k nodes, (n >= 1, 2 <= k <= n+1).
Terms
- a(0) =1a(1) =3a(2) =12a(3) =15a(4) =180a(5) =240a(6) =105a(7) =5040a(8) =6720a(9) =7000a(10) =945a(11) =151200a(12) =352800a(13) =315000a(14) =272160a(15) =10395a(16) =6029100a(17) =21067200a(18) =20790000a(19) =17962560a(20) =13311144a(21) =135135a(22) =276215940a(23) =1387386000a(24) =1765764000a(25) =1471133664a(26) =1211314104a(27) =787218432a(28) =2027025a(29) =14983768800
External references
- oeis: A332959