Number of rooted trees with 5 nodes of 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.
A005175
Number of rooted trees with 5 nodes of 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) =0a(1) =0a(2) =3a(3) =131a(4) =1830a(5) =16990a(6) =127953a(7) =851361a(8) =5231460a(9) =30459980a(10) =170761503a(11) =931484191a(12) =4979773890a(13) =26223530970a(14) =136522672653a(15) =704553794621
External references
- oeis: A005175