A293993 -id:A293993 - cp's OEIS frontend

A304382 Number of z-trees summing to n. Number of connected strict integer partitions of n with pairwise indivisible parts and clutter density -1.

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 3, 2, 4, 3, 5, 2, 5, 4, 6, 3, 7, 6, 8, 4, 9, 8, 13, 9, 15, 8, 14, 12, 16, 12, 20, 20, 24, 15, 27, 20, 33, 27, 35

Offset: 1

Gus Wiseman, May 21 2018

Given a finite set S of positive integers greater than one, let G(S) be the simple labeled graph with vertex set S and edges between any two vertices with a common divisor. For example, G({6,14,15,35}) is a 4-cycle. A multiset S is said to be connected if G(S) is a connected graph.

The clutter density of a multiset S of positive integers is Sum_{s in S} (omega(s) - 1) - omega(LCM(S)).

			The a(30) = 8 z-trees together with the corresponding multiset systems are the following.
       (30): {{1,2,3}}
     (26,4): {{1,6},{1,1}}
     (22,8): {{1,5},{1,1,1}}
     (21,9): {{2,4},{2,2}}
    (16,14): {{1,1,1,1},{1,4}}
   (15,9,6): {{2,3},{2,2},{1,2}}
  (14,10,6): {{1,4},{1,3},{1,2}}
  (12,10,8): {{1,1,2},{1,3},{1,1,1}}

Roland Bacher, On the enumeration of labelled hypertrees and of labelled bipartite trees, arXiv:1102.2708 [math.CO], 2011.

Cf. A000009, A006126, A048143, A054921, A112798, A285572, A286518, A286520, A293993, A303362, A303837, A304714, A304716, A305194, A305195.

zsm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[Less@@#,GCD@@s[[#]]]>1&]},If[c=={},s,zsm[Union[Append[Delete[s,List/@c[[1]]],LCM@@s[[c[[1]]]]]]]]];
zensity[s_]:=Total[(PrimeNu[#]-1&)/@s]-PrimeNu[LCM@@s];
zreeQ[s_]:=And[Length[s]>=2,zensity[s]==-1];
strConnAnti[n_]:=Select[IntegerPartitions[n],UnsameQ@@#&&Length[zsm[#]]==1&&Select[Tuples[#,2],UnsameQ@@#&&Divisible@@#&]=={}&];
Table[Length[Select[strConnAnti[n],Length[#]==1||zreeQ[#]&]],{n,20}]

A306505 Number of non-isomorphic antichains of nonempty subsets of {1,...,n}.

Original entry on oeis.org

1, 2, 4, 9, 29, 209, 16352, 490013147, 1392195548889993357, 789204635842035040527740846300252679

Offset: 0

Gus Wiseman, Feb 20 2019

The spanning case is A006602 or A261005. The labeled case is A014466.
From Petros Hadjicostas, Apr 22 2020: (Start)
a(n) is the number of "types" of log-linear hierarchical models on n factors in the sense of Colin Mallows (see the emails to N. J. A. Sloane).
Two hierarchical models on n factors belong to the same "type" iff one can obtained from the other by a permutation of the factors.
The total number of hierarchical log-linear models on n factors (in all "types") is given by A014466(n) = A000372(n) - 1.
The name of a hierarchical log-linear model on factors is based on the collection of maximal interaction terms, which must be an antichain (by the definition of maximality).
In his example on p. 1, Colin Mallows groups the A014466(3) = 19 hierarchical log-linear models on n = 3 factors x, y, z into a(3) = 9 types. See my example below for more details. (End)
First differs from A348260(n + 1) - 1 at a(5) = 209, A348260(6) - 1 = 232. - Gus Wiseman, Nov 28 2021

			Non-isomorphic representatives of the a(0) = 1 through a(3) = 9 antichains:
  {}  {}     {}         {}
      {{1}}  {{1}}      {{1}}
             {{1,2}}    {{1,2}}
             {{1},{2}}  {{1},{2}}
                        {{1,2,3}}
                        {{1},{2,3}}
                        {{1},{2},{3}}
                        {{1,3},{2,3}}
                        {{1,2},{1,3},{2,3}}
From _Petros Hadjicostas_, Apr 23 2020: (Start)
We expand _Colin Mallows_'s example from p. 1 of his list of 1991 emails. For n = 3, we have the following a(3) = 9 "types" of log-linear hierarchical models:
Type 1: ( ), Type 2: (x), (y), (z), Type 3: (x,y), (y,z), (z,x), Type 4: (x,y,z), Type 5: (xy), (yz), (zx), Type 6: (xy,z), (yz,x), (zx,y), Type 7: (xy,xz), (yx,yz), (zx,zy), Type 8: (xy,yz,zx), Type 9: (xyz).
For each model, the name only contains the maximal terms. See p. 36 in Wickramasinghe (2008) for the full description of the 19 models.
Strictly speaking, I should have used set notation (rather than parentheses) for the name of each model, but I follow the tradition of the theory of log-linear models. In addition, in an interaction term such as xy, the order of the factors is irrelevant.
Models in the same type essentially have similar statistical properties.
For example, models in Type 7 have the property that two factors are conditionally independent of one another given each level (= category) of the third factor.
Models in Type 6 are such that two factors are jointly independent from the third one. (End)

C. L. Mallows, Emails to N. J. A. Sloane, Jun-Jul 1991, p. 1.
R. I. P. Wickramasinghe, Topics in log-linear models, Master of Science thesis in Statistics, Texas Tech University, Lubbock, TX, 2008, p. 36.
Gus Wiseman, Sequences enumerating clutters, antichains, hypertrees, and hyperforests, organized by labeling, spanning, and allowance of singletons.

Cf. A000372, A003182, A006126, A006602, A014466, A261005, A293606, A293993, A304996, A305000, A305001, A305857, A317674, A319721, A320449, A321679.

Cf. A007363, A306007, A307249, A326358, A326359, A326360, A326363.

a(n) = A003182(n) - 1.

Partial sums of A006602 minus 1.

a(8) from A003182. - Bartlomiej Pawelski, Nov 27 2022

a(9) from A003182. - Dmitry I. Ignatov, Nov 27 2023

A327351 Triangle read by rows where T(n,k) is the number of antichains of nonempty sets covering n vertices with vertex-connectivity exactly k.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 4, 3, 2, 0, 30, 40, 27, 17, 0, 546, 1365, 1842, 1690, 1451, 0, 41334

Offset: 0

Gus Wiseman, Sep 09 2019

An antichain is a set of sets, none of which is a subset of any other. It is covering if there are no isolated vertices.
The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any empty or duplicate edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.
If empty edges are allowed, we have T(0,0) = 2.

			Triangle begins:
    1
    1    0
    1    1    0
    4    3    2    0
   30   40   27   17    0
  546 1365 1842 1690 1451    0

Row sums are A307249, or A006126 if empty edges are allowed.
Column k = 0 is A120338, if we assume A120338(0) = A120338(1) = 1.
Column k = 1 is A327356.
Column k = n - 1 is A327020.
The unlabeled version is A327359.
The version for vertex-connectivity >= k is A327350.
The version for spanning edge-connectivity is A327352.
The version for non-spanning edge-connectivity is A327353, with covering case A327357.
Cf. A003465, A006126, A014466, A048143, A293993, A323818, A326704, A327125, A327334, A327336.

csm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],Length[Intersection@@s[[#]]]>0&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
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]]]];
vertConnSys[vts_,eds_]:=Min@@Length/@Select[Subsets[vts],Function[del,Length[del]==Length[vts]-1||csm[DeleteCases[DeleteCases[eds,Alternatives@@del,{2}],{}]]!={Complement[vts,del]}]]
Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],SubsetQ],Union@@#==Range[n]&&vertConnSys[Range[n],#]==k&]],{n,0,4},{k,0,n}]

a(21) from Robert Price, May 28 2021

A304996 Number of unlabeled antichains of finite sets spanning up to n vertices with singleton edges allowed.

Original entry on oeis.org

1, 2, 6, 24, 166, 3266, 826308

Offset: 0

Gus Wiseman, May 23 2018

			Non-isomorphic representatives of the a(3) = 24 antichains:
{}
{{1}}
{{1,2}}
{{1,2,3}}
{{1},{2}}
{{2},{1,2}}
{{3},{1,2}}
{{3},{1,2,3}}
{{1,3},{2,3}}
{{1},{2},{3}}
{{1},{2},{1,2}}
{{2},{3},{1,3}}
{{2},{3},{1,2,3}}
{{3},{1,2},{2,3}}
{{3},{1,3},{2,3}}
{{1,2},{1,3},{2,3}}
{{1},{2},{3},{2,3}}
{{1},{2},{3},{1,2,3}}
{{2},{3},{1,2},{1,3}}
{{2},{3},{1,3},{2,3}}
{{3},{1,2},{1,3},{2,3}}
{{1},{2},{3},{1,3},{2,3}}
{{2},{3},{1,2},{1,3},{2,3}}
{{1},{2},{3},{1,2},{1,3},{2,3}}

Partial sums of A304997.
Cf. A006126, A261005, A304997, A304998, A304999, A305000, A305001.
Cf. A000372, A014466, A293993, A319639, A319721, A326704, A326972.

a(5)-a(6) from Andrew Howroyd, Aug 14 2019

A321679 Number of non-isomorphic weight-n antichains (not necessarily strict) of sets.

Original entry on oeis.org

1, 1, 3, 5, 12, 19, 45, 75, 170, 314, 713

Offset: 0

Gus Wiseman, Nov 16 2018

The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(5) = 19 antichains:
  {{1}}  {{1,2}}    {{1,2,3}}      {{1,2,3,4}}        {{1,2,3,4,5}}
         {{1},{1}}  {{1},{2,3}}    {{1,2},{1,2}}      {{1},{2,3,4,5}}
         {{1},{2}}  {{1},{1},{1}}  {{1},{2,3,4}}      {{1,2},{3,4,5}}
                    {{1},{2},{2}}  {{1,2},{3,4}}      {{1,4},{2,3,4}}
                    {{1},{2},{3}}  {{1,3},{2,3}}      {{1},{1},{2,3,4}}
                                   {{1},{1},{2,3}}    {{1},{2,3},{2,3}}
                                   {{1},{2},{3,4}}    {{1},{2},{3,4,5}}
                                   {{1},{1},{1},{1}}  {{1},{2,3},{4,5}}
                                   {{1},{1},{2},{2}}  {{1},{2,4},{3,4}}
                                   {{1},{2},{2},{2}}  {{1},{1},{1},{2,3}}
                                   {{1},{2},{3},{3}}  {{1},{2},{2},{3,4}}
                                   {{1},{2},{3},{4}}  {{1},{2},{3},{4,5}}
                                                      {{1},{1},{1},{1},{1}}
                                                      {{1},{1},{2},{2},{2}}
                                                      {{1},{2},{2},{2},{2}}
                                                      {{1},{2},{2},{3},{3}}
                                                      {{1},{2},{3},{3},{3}}
                                                      {{1},{2},{3},{4},{4}}
                                                      {{1},{2},{3},{4},{5}}

Cf. A006126, A049311, A096827, A285572, A293993, A293994, A318099, A319719, A319721, A320799, A321678.

A327350 Triangle read by rows where T(n,k) is the number of antichains of nonempty sets covering n vertices with vertex-connectivity >= k.

Original entry on oeis.org

1, 1, 0, 2, 1, 0, 9, 5, 2, 0, 114, 84, 44, 17, 0, 6894, 6348, 4983, 3141, 1451, 0, 7785062

Offset: 0

Gus Wiseman, Sep 09 2019

An antichain is a set of sets, none of which is a subset of any other. It is covering if there are no isolated vertices.
The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any empty or duplicate edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.
If empty edges are allowed, we have T(0,0) = 2.

			Triangle begins:
     1
     1    0
     2    1    0
     9    5    2    0
   114   84   44   17    0
  6894 6348 4983 3141 1451    0
The antichains counted in row n = 3:
  {123}         {123}         {123}
  {1}{23}       {12}{13}      {12}{13}{23}
  {2}{13}       {12}{23}
  {3}{12}       {13}{23}
  {12}{13}      {12}{13}{23}
  {12}{23}
  {13}{23}
  {1}{2}{3}
  {12}{13}{23}

Column k = 0 is A307249, or A006126 if empty edges are allowed.
Column k = 1 is A048143 (clutters), if we assume A048143(0) = A048143(1) = 0.
Column k = 2 is A275307 (blobs), if we assume A275307(1) = A275307(2) = 0.
Column k = n - 1 is A327020 (cointersecting antichains).
The unlabeled version is A327358.
Negated first differences of rows are A327351.
BII-numbers of antichains are A326704.
Antichain covers are A006126.
Cf. A003465, A014466, A120338, A293606, A293993, A319639, A323818, A327112, A327125, A327334, A327336, A327352, A327356, A327357, A327358.

csm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],Length[Intersection@@s[[#]]]>0&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
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]]]];
vertConnSys[vts_,eds_]:=Min@@Length/@Select[Subsets[vts],Function[del,Length[del]==Length[vts]-1||csm[DeleteCases[DeleteCases[eds,Alternatives@@del,{2}],{}]]!={Complement[vts,del]}]];
Table[Length[Select[stableSets[Subsets[Range[n],{1,n}],SubsetQ],Union@@#==Range[n]&&vertConnSys[Range[n],#]>=k&]],{n,0,4},{k,0,n}]

a(21) from Robert Price, May 24 2021

A319837 Numbers whose distinct prime indices are pairwise indivisible and whose own prime indices span an initial interval of positive integers.

Original entry on oeis.org

1, 2, 3, 4, 7, 8, 9, 13, 15, 16, 19, 27, 32, 35, 37, 45, 49, 53, 61, 64, 69, 75, 81, 89, 91, 95, 113, 128, 131, 135, 141, 143, 145, 151, 161, 165, 169, 175, 207, 223, 225, 243, 245, 247, 251, 256, 265, 281, 299, 309, 311, 329, 343, 355, 359, 361, 375, 377, 385

Offset: 1

Gus Wiseman, Dec 16 2018

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset multisystem with MM-number 78 is {{},{1},{1,2}}. This sequence lists all MM-numbers of not necessarily strict antichains of multisets spanning an initial interval of positive integers.

			The sequence of multisystems whose MM-numbers belong to the sequence begins:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   7: {{1,1}}
   8: {{},{},{}}
   9: {{1},{1}}
  13: {{1,2}}
  15: {{1},{2}}
  16: {{},{},{},{}}
  19: {{1,1,1}}
  27: {{1},{1},{1}}
  32: {{},{},{},{},{}}
  35: {{2},{1,1}}
  37: {{1,1,2}}
  45: {{1},{1},{2}}
  49: {{1,1},{1,1}}
  53: {{1,1,1,1}}
  61: {{1,2,2}}
  64: {{},{},{},{},{},{}}
  69: {{1},{2,2}}
  75: {{1},{2},{2}}
  81: {{1},{1},{1},{1}}
  89: {{1,1,1,2}}
  91: {{1,1},{1,2}}
  95: {{2},{1,1,1}}

Cf. A003963, A006126, A055932, A056239, A112798, A285572, A290103, A293993, A302242, A304713, A316476, A318401, A319721, A320275, A320456.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[200],And[normQ[primeMS/@primeMS[#]],stableQ[primeMS[#],Divisible]]&]

A327358 Triangle read by rows where T(n,k) is the number of unlabeled antichains of nonempty sets covering n vertices with vertex-connectivity >= k.

Original entry on oeis.org

1, 1, 0, 2, 1, 0, 5, 3, 2, 0, 20, 14, 10, 6, 0, 180, 157, 128, 91, 54, 0

Offset: 0

Gus Wiseman, Sep 09 2019

An antichain is a set of sets, none of which is a subset of any other. It is covering if there are no isolated vertices.
The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any empty or duplicate edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.
If empty edges are allowed, we have T(0,0) = 2.

			Triangle begins:
    1
    1   0
    2   1   0
    5   3   2   0
   20  14  10   6   0
  180 157 128  91  54   0
Non-isomorphic representatives of the antichains counted in row n = 4:
  {1234}          {1234}           {1234}           {1234}
  {1}{234}        {12}{134}        {123}{124}       {12}{134}{234}
  {12}{34}        {123}{124}       {12}{13}{234}    {123}{124}{134}
  {12}{134}       {12}{13}{14}     {12}{134}{234}   {12}{13}{14}{234}
  {123}{124}      {12}{13}{24}     {123}{124}{134}  {123}{124}{134}{234}
  {1}{2}{34}      {12}{13}{234}    {12}{13}{24}{34} {12}{13}{14}{23}{24}{34}
  {2}{13}{14}     {12}{134}{234}   {12}{13}{14}{234}
  {12}{13}{14}    {123}{124}{134}  {12}{13}{14}{23}{24}
  {12}{13}{24}    {12}{13}{14}{23} {123}{124}{134}{234}
  {1}{2}{3}{4}    {12}{13}{24}{34} {12}{13}{14}{23}{24}{34}
  {12}{13}{234}   {12}{13}{14}{234}
  {12}{134}{234}  {12}{13}{14}{23}{24}
  {123}{124}{134} {123}{124}{134}{234}
  {4}{12}{13}{23} {12}{13}{14}{23}{24}{34}
  {12}{13}{14}{23}
  {12}{13}{24}{34}
  {12}{13}{14}{234}
  {12}{13}{14}{23}{24}
  {123}{124}{134}{234}
  {12}{13}{14}{23}{24}{34}

Column k = 0 is A261005, or A006602 if empty edges are allowed.
Column k = 1 is A261006 (clutters), if we assume A261006(0) = A261006(1) = 0.
Column k = 2 is A305028 (blobs), if we assume A305028(0) = A305028(2) = 0.
Column k = n - 1 is A327425 (cointersecting).
The labeled version is A327350.
Negated first differences of rows are A327359.
Cf. A006126, A055621, A120338, A293606, A293993, A327334, A327351, A327356.

A317074 Number of antichains of multisets with multiset-join a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 3, 13, 148, 7685

Offset: 0

Gus Wiseman, Jul 20 2018

An antichain of multisets is a finite set of finite nonempty multisets, none of which is a submultiset of any other. A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. The multiset-join of a multiset system has the same vertices with multiplicities equal to the maxima of the multiplicities in the edges.

			The a(3) = 13 antichains of multisets:
  (111),
  (112), (11)(12), (2)(11),
  (123), (13)(23), (12)(23), (12)(13), (12)(13)(23), (3)(12), (2)(13), (1)(23), (1)(2)(3).

Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, Journal of Integer Sequences, Vol. 7 (2004).

Cf. A048143, A285572, A293993, A293994, A303837, A303838, A304998, A305001.

Cf. A317073, A317076, A317078, A317079.

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]]]];
multijoin[mss__]:=Join@@Table[Table[x,{Max[Count[#,x]&/@{mss}]}],{x,Union[mss]}];
submultisetQ[M_,N_]:=Or[Length[M]==0,MatchQ[{Sort[List@@M],Sort[List@@N]},{{x_,Z___},{_,x_,W___}}/;submultisetQ[{Z},{W}]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
auu[m_]:=Select[stableSets[Union[Rest[Subsets[m]]],submultisetQ],multijoin@@#==m&];
Table[Length[Join@@Table[auu[m],{m,strnorm[n]}]],{n,5}]

A317080 Number of unlabeled connected antichains of multisets with multiset-join a multiset of size n.

Original entry on oeis.org

1, 1, 2, 6, 34, 392

Offset: 0

Gus Wiseman, Jul 20 2018

An antichain of multisets is a finite set of finite nonempty multisets, none of which is a submultiset of any other. The multiset-join of a multiset system has the same vertices with multiplicities equal to the maxima of the multiplicities in the edges.

			Non-isomorphic representatives of the a(3) = 6 connected antichains of multisets:
  (111),
  (122), (12)(22),
  (123), (13)(23), (12)(13)(23).

Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, Journal of Integer Sequences, Vol. 7 (2004).

Cf. A007716, A007718, A048143, A261006, A286520, A293993, A293994, A304716, A304998.

Cf. A317073, A317074, A317075, A317076, A317077, A317078, A317079.

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]]]];
multijoin[mss__]:=Join@@Table[Table[x,{Max[Count[#,x]&/@{mss}]}],{x,Union[mss]}]
submultisetQ[M_,N_]:=Or[Length[M]==0,MatchQ[{Sort[List@@M],Sort[List@@N]},{{x_,Z___},{_,x_,W___}}/;submultisetQ[{Z},{W}]]];
csm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[OrderedQ[#],UnsameQ@@#,Length[Intersection@@s[[#]]]>0]&]},If[c=={},s,csm[Union[Append[Delete[s,List/@c[[1]]],multijoin@@s[[c[[1]]]]]]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
sysnorm[m_]:=First[Sort[sysnorm[m,1]]];
sysnorm[m_,aft_]:=If[Length[Union@@m]<=aft,{m},With[{mx=Table[Count[m,i,{2}],{i,Select[Union@@m,#>=aft&]}]},Union@@(sysnorm[#,aft+1]&/@Union[Table[Map[Sort,m/.{par+aft-1->aft,aft->par+aft-1},{0,1}],{par,First/@Position[mx,Max[mx]]}]])]];
cuu[m_]:=Select[stableSets[Union[Rest[Subsets[m]]],submultisetQ],And[multijoin@@#==m,Length[csm[#]]==1]&];
Table[Length[Union[sysnorm/@Join@@Table[cuu[m],{m,strnorm[n]}]]],{n,5}]

cp's OEIS Frontend

A304382 Number of z-trees summing to n. Number of connected strict integer partitions of n with pairwise indivisible parts and clutter density -1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A306505 Number of non-isomorphic antichains of nonempty subsets of {1,...,n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A327351 Triangle read by rows where T(n,k) is the number of antichains of nonempty sets covering n vertices with vertex-connectivity exactly k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A304996 Number of unlabeled antichains of finite sets spanning up to n vertices with singleton edges allowed.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A321679 Number of non-isomorphic weight-n antichains (not necessarily strict) of sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A327350 Triangle read by rows where T(n,k) is the number of antichains of nonempty sets covering n vertices with vertex-connectivity >= k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A319837 Numbers whose distinct prime indices are pairwise indivisible and whose own prime indices span an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327358 Triangle read by rows where T(n,k) is the number of unlabeled antichains of nonempty sets covering n vertices with vertex-connectivity >= k.

Views

Author

Keywords

Comments

Examples

Crossrefs

A317074 Number of antichains of multisets with multiset-join a strongly normal multiset of size n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs