Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, k of which are used for root nodes and any root may contain >= 1 labels, n >= 0, 0<=k<=n.
A143396
Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, k of which are used for root nodes and any root may contain >= 1 labels, n >= 0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =2a(6) =0a(7) =3a(8) =9a(9) =5a(10) =0a(11) =4a(12) =30a(13) =40a(14) =15a(15) =0a(16) =5a(17) =90a(18) =220a(19) =185a(20) =52a(21) =0a(22) =6a(23) =255a(24) =1040a(25) =1485a(26) =906a(27) =203a(28) =0a(29) =7
External references
- oeis: A143396