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 A316892 #10 Feb 07 2020 19:34:08
%S A316892 1,1,3,9,24,69,211,654
%N A316892 Number of non-isomorphic strict multiset partitions of {1, 1, 2, 2, 3, 3, ..., n, n} with no equivalent vertices.
%C A316892 Also the number of unlabeled graphs with n edges, allowing loops, with no equivalent vertices (two vertices are equivalent if in every edge the multiplicity of the first is equal to the multiplicity of the second). For example, non-isomorphic representatives of the a(2) = 3 multigraphs are {(1,2),(1,3)}, {(1,1),(1,2)}, {(1,1),(2,2)}.
%e A316892 Non-isomorphic representatives of the a(3) = 9 strict multiset partitions:
%e A316892 (112)(233)
%e A316892 (1)(2)(1233)
%e A316892 (1)(12)(233)
%e A316892 (2)(11)(233)
%e A316892 (11)(22)(33)
%e A316892 (12)(13)(23)
%e A316892 (1)(2)(3)(123)
%e A316892 (1)(2)(12)(33)
%e A316892 (1)(2)(13)(23)
%Y A316892 Cf. A007716, A007717, A020555, A050535, A053419, A094574, A316974.
%K A316892 nonn,more
%O A316892 0,3
%A A316892 _Gus Wiseman_, Jul 18 2018
%E A316892 a(6)-a(7) from _Andrew Howroyd_, Feb 07 2020