Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.
A143397
Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =3a(6) =0a(7) =1a(8) =6a(9) =10a(10) =0a(11) =1a(12) =11a(13) =36a(14) =41a(15) =0a(16) =1a(17) =20a(18) =105a(19) =230a(20) =196a(21) =0a(22) =1a(23) =37a(24) =285a(25) =955a(26) =1560a(27) =1057a(28) =0a(29) =1
External references
- oeis: A143397