Triangle read by rows: T(n,k) = number of forests of k labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, n >= 0, 0 <= k <= n.

A143395

Triangle read by rows: T(n,k) = number of forests of k labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, n >= 0, 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =3a(5) =1a(6) =0a(7) =7a(8) =9a(9) =1a(10) =0a(11) =15a(12) =55a(13) =18a(14) =1a(15) =0a(16) =31a(17) =285a(18) =205a(19) =30a(20) =1a(21) =0a(22) =63a(23) =1351a(24) =1890a(25) =545a(26) =45a(27) =1a(28) =0a(29) =127

External references