The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330624 Number of non-isomorphic series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with a total of n elements. 9
 1, 1, 3, 10, 61, 410, 3630 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes. LINKS Table of n, a(n) for n=0..6. EXAMPLE Non-isomorphic representatives of the a(1) = 1 through a(3) = 10 trees: {1} {1,2} {1,2,3} {{1},{1}} {{1},{1,2}} {{1},{2}} {{1},{2,3}} {{1},{1},{1}} {{1},{1},{2}} {{1},{2},{3}} {{1},{{1},{1}}} {{1},{{1},{2}}} {{1},{{2},{3}}} {{2},{{1},{1}}} CROSSREFS The version with multisets as leaves is A330465. The singleton-reduced case is A330626. A labeled version is A330625 (strongly normal). The case with all atoms distinct is A141268. The case where all leaves are singletons is A330470. Cf. A000669, A004111, A005804, A007716, A273873, A300660, A320296, A330628, A330668, A330677. Sequence in context: A009654 A013565 A156075 * A228773 A034889 A260969 Adjacent sequences: A330621 A330622 A330623 * A330625 A330626 A330627 KEYWORD nonn,more AUTHOR Gus Wiseman, Dec 25 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 22 08:12 EDT 2024. Contains 371893 sequences. (Running on oeis4.)