Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).

A133399

Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =9a(6) =1a(7) =28a(8) =12a(9) =1a(10) =75a(11) =120a(12) =1a(13) =186a(14) =750a(15) =120a(16) =1a(17) =441a(18) =3780a(19) =2100a(20) =1a(21) =1016a(22) =16856a(23) =21840a(24) =1680a(25) =1a(26) =2295a(27) =69552a(28) =176400a(29) =45360

External references