This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A330624 #8 Apr 27 2020 09:44:02
%S A330624 1,1,3,10,61,410,3630
%N A330624 Number of non-isomorphic series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with a total of n elements.
%C A330624 A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes.
%e A330624 Non-isomorphic representatives of the a(1) = 1 through a(3) = 10 trees:
%e A330624 {1} {1,2} {1,2,3}
%e A330624 {{1},{1}} {{1},{1,2}}
%e A330624 {{1},{2}} {{1},{2,3}}
%e A330624 {{1},{1},{1}}
%e A330624 {{1},{1},{2}}
%e A330624 {{1},{2},{3}}
%e A330624 {{1},{{1},{1}}}
%e A330624 {{1},{{1},{2}}}
%e A330624 {{1},{{2},{3}}}
%e A330624 {{2},{{1},{1}}}
%Y A330624 The version with multisets as leaves is A330465.
%Y A330624 The singleton-reduced case is A330626.
%Y A330624 A labeled version is A330625 (strongly normal).
%Y A330624 The case with all atoms distinct is A141268.
%Y A330624 The case where all leaves are singletons is A330470.
%Y A330624 Cf. A000669, A004111, A005804, A007716, A273873, A300660, A320296, A330628, A330668, A330677.
%K A330624 nonn,more
%O A330624 0,3
%A A330624 _Gus Wiseman_, Dec 25 2019