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 A326569 #13 Aug 14 2019 01:48:47 %S A326569 1,0,1,1,13,121,2566,121199,13254529 %N A326569 Number of covering antichains of subsets of {1..n} with no singletons and different edge-sizes. %C A326569 An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sizes are the numbers of vertices in each edge, so for example the edge sizes of {{1,3},{2,5},{3,4,5}} are {2,2,3}. %F A326569 a(n) = A326570(n) - n*a(n-1) for n > 0. - _Andrew Howroyd_, Aug 13 2019 %e A326569 The a(2) = 1 through a(4) = 13 antichains: %e A326569 {{1,2}} {{1,2,3}} {{1,2,3,4}} %e A326569 {{1,2},{1,3,4}} %e A326569 {{1,2},{2,3,4}} %e A326569 {{1,3},{1,2,4}} %e A326569 {{1,3},{2,3,4}} %e A326569 {{1,4},{1,2,3}} %e A326569 {{1,4},{2,3,4}} %e A326569 {{2,3},{1,2,4}} %e A326569 {{2,3},{1,3,4}} %e A326569 {{2,4},{1,2,3}} %e A326569 {{2,4},{1,3,4}} %e A326569 {{3,4},{1,2,3}} %e A326569 {{3,4},{1,2,4}} %t A326569 stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]]; %t A326569 cleq[n_]:=Select[stableSets[Subsets[Range[n],{2,n}],SubsetQ[#1,#2]||Length[#1]==Length[#2]&],Union@@#==Range[n]&]; %t A326569 Table[Length[cleq[n]],{n,0,6}] %Y A326569 Antichain covers are A006126. %Y A326569 Set partitions with different block sizes are A007837. %Y A326569 The case with singletons is A326570. %Y A326569 Cf. A000372, A003182, A306021, A307249, A326565, A326571, A326572, A326573. %K A326569 nonn,more %O A326569 0,5 %A A326569 _Gus Wiseman_, Jul 18 2019 %E A326569 a(8) from _Andrew Howroyd_, Aug 13 2019