Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.
A143398
Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =3a(5) =1a(6) =0a(7) =10a(8) =3a(9) =1a(10) =0a(11) =41a(12) =9a(13) =4a(14) =1a(15) =0a(16) =196a(17) =40a(18) =10a(19) =5a(20) =1a(21) =0a(22) =1057a(23) =210a(24) =30a(25) =15a(26) =6a(27) =1a(28) =0a(29) =6322
External references
- oeis: A143398