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 A319565 #10 Sep 24 2018 08:58:09
%S A319565 1,1,1,4,8,21,62,175,553,1775,6007
%N A319565 Number of non-isomorphic connected strict T_0 multiset partitions of weight n.
%C A319565 In a multiset partition, two vertices are equivalent if in every block the multiplicity of the first is equal to the multiplicity of the second. The T_0 condition means that there are no equivalent vertices.
%C A319565 The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
%e A319565 Non-isomorphic representatives of the a(1) = 1 through a(4) = 8 multiset partitions:
%e A319565 1: {{1}}
%e A319565 2: {{1,1}}
%e A319565 3: {{1,1,1}}
%e A319565 {{1,2,2}}
%e A319565 {{1},{1,1}}
%e A319565 {{2},{1,2}}
%e A319565 4: {{1,1,1,1}}
%e A319565 {{1,2,2,2}}
%e A319565 {{1},{1,1,1}}
%e A319565 {{1},{1,2,2}}
%e A319565 {{2},{1,2,2}}
%e A319565 {{1,2},{2,2}}
%e A319565 {{1,3},{2,3}}
%e A319565 {{1},{2},{1,2}}
%Y A319565 Cf. A007716, A007718, A049311, A056156, A059201, A283877, A316980.
%Y A319565 Cf. A319557, A319558, A319559, A319560, A319564, A319566, A319567.
%K A319565 nonn,more
%O A319565 0,4
%A A319565 _Gus Wiseman_, Sep 23 2018