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 A326906 #4 Aug 03 2019 14:18:04
%S A326906 2,2,8,90,4542,2747402,151930948472,28175295407840207894
%N A326906 Number of sets of subsets of {1..n} that are closed under union and cover all n vertices.
%C A326906 Differs from A102895 in having a(0) = 2 instead of 1.
%F A326906 a(n) = 2 * A102894(n).
%e A326906 The a(0) = 2 through a(2) = 8 sets of subsets:
%e A326906 {} {{1}} {{1,2}}
%e A326906 {{}} {{},{1}} {{},{1,2}}
%e A326906 {{1},{1,2}}
%e A326906 {{2},{1,2}}
%e A326906 {{},{1},{1,2}}
%e A326906 {{},{2},{1,2}}
%e A326906 {{1},{2},{1,2}}
%e A326906 {{},{1},{2},{1,2}}
%t A326906 Table[Length[Select[Subsets[Subsets[Range[n]]],Union@@#==Range[n]&&SubsetQ[#,Union@@@Tuples[#,2]]&]],{n,0,3}]
%Y A326906 The case without empty sets is A102894.
%Y A326906 The case with a single covering edge is A102895.
%Y A326906 Binomial transform is A102897.
%Y A326906 The case also closed under intersection is A326878 for n > 0.
%Y A326906 The same for intersection instead of union is (also) A326906.
%Y A326906 The unlabeled version is A326907.
%Y A326906 Cf. A000798, A102896, A102897, A108800, A193675, A306445, A326880, A326881, A326883.
%K A326906 nonn,more
%O A326906 0,1
%A A326906 _Gus Wiseman_, Aug 03 2019