Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.
A094262
Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =6a(6) =12a(7) =10a(8) =3a(9) =1a(10) =14a(11) =61a(12) =124a(13) =131a(14) =70a(15) =15a(16) =1a(17) =30a(18) =240a(19) =890a(20) =1830a(21) =2226a(22) =1600a(23) =630a(24) =105a(25) =1a(26) =62a(27) =841a(28) =5060a(29) =16990
External references
- oeis: A094262