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 A326942 #7 Aug 18 2019 08:27:36
%S A326942 2,2,6,58,3770
%N A326942 Number of unlabeled T_0 sets of subsets of {1..n} that cover all n vertices.
%C A326942 The dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex, counted with multiplicity. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. The T_0 condition means that the dual is strict (no repeated edges).
%F A326942 a(n) = 2 * A319637(n).
%e A326942 Non-isomorphic representatives of the a(0) = 2 through a(2) = 6 sets of subsets:
%e A326942 {} {{1}} {{1},{2}}
%e A326942 {{}} {{},{1}} {{2},{1,2}}
%e A326942 {{},{1},{2}}
%e A326942 {{},{2},{1,2}}
%e A326942 {{1},{2},{1,2}}
%e A326942 {{},{1},{2},{1,2}}
%Y A326942 The non-T_0 version is A003181.
%Y A326942 The case without empty edges is A319637.
%Y A326942 The labeled version is A326939.
%Y A326942 The non-covering version is A326949 (partial sums).
%Y A326942 Cf. A000371, A003180, A055621, A059201, A316978, A319559, A319564, A326907, A326941, A326943, A326946.
%K A326942 nonn,more
%O A326942 0,1
%A A326942 _Gus Wiseman_, Aug 07 2019