A326358 -id:A326358 - cp's OEIS frontend

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

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

A326360 Number of maximal antichains of nonempty, non-singleton subsets of {1..n}.

Original entry on oeis.org

1, 1, 1, 2, 13, 279, 29820, 123590767

Offset: 0

Gus Wiseman, Jul 01 2019

A set system (set of sets) is an antichain if no element is a subset of any other.

			The a(1) = 1 through a(4) = 13 maximal antichains:
  {}  {12}  {123}         {1234}
            {12}{13}{23}  {12}{134}{234}
                          {13}{124}{234}
                          {14}{123}{234}
                          {23}{124}{134}
                          {24}{123}{134}
                          {34}{123}{124}
                          {12}{13}{14}{234}
                          {12}{23}{24}{134}
                          {13}{23}{34}{124}
                          {14}{24}{34}{123}
                          {123}{124}{134}{234}
                          {12}{13}{14}{23}{24}{34}

Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.
Dmitry I. Ignatov, Supporting iPython code and input files for a(7) based on inequivalent maximal antichains for n=7 and related sequences, Github repository, section 3
Dmitry I. Ignatov, PDF version of the supporting iPython notebook for a(7)
Dmitry I. Ignatov, Supporting iPython notebook for a(7): A326360.ipynb

Antichains of nonempty, non-singleton sets are A307249.
Minimal covering antichains are A046165.
Maximal intersecting antichains are A007363.
Maximal antichains of nonempty sets are A326359.
Cf. A000372, A003182, A006126, A006602, A014466, A058891, A261005, A305000, A305844, A326358, A326361, A326362, A326363.

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]]]];
fasmax[y_]:=Complement[y,Union@@(Most[Subsets[#]]&/@y)];
Table[Length[fasmax[stableSets[Subsets[Range[n],{2,n}],SubsetQ]]],{n,0,4}]

# see Ignatov links
# Dmitry I. Ignatov, Oct 14 2021

a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n,k)*A326359(k) for n >= 2. - Andrew Howroyd, Nov 19 2021

a(6) from Andrew Howroyd, Aug 14 2019

a(7) from Dmitry I. Ignatov, Oct 14 2021

A343659 Number of maximal pairwise coprime subsets of {1..n}.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 3, 4, 7, 9, 9, 10, 10, 12, 16, 19, 19, 20, 20, 22, 28, 32, 32, 33, 54, 61, 77, 84, 84, 85, 85, 94, 112, 123, 158, 161, 161, 176, 206, 212, 212, 214, 214, 229, 241, 260, 260, 263, 417, 428, 490, 521, 521, 526, 655, 674, 764, 818, 818, 820, 820, 874, 918, 975, 1182, 1189, 1189

Offset: 1

Gus Wiseman, Apr 26 2021

nonn

For this sequence, it does not matter whether singletons are considered pairwise coprime.
For n > 2, also the number of maximal pairwise coprime subsets of {2..n}.
For each prime p <= n, p divides exactly one element of each maximal subset. - Bert Dobbelaere, May 04 2021

			The a(1) = 1 through a(9) = 7 subsets:
  {1}  {12}  {123}  {123}  {1235}  {156}   {1567}   {1567}   {1567}
                    {134}  {1345}  {1235}  {12357}  {12357}  {12357}
                                   {1345}  {13457}  {13457}  {12579}
                                                    {13578}  {13457}
                                                             {13578}
                                                             {14579}
                                                             {15789}

Bert Dobbelaere, Table of n, a(n) for n = 1..500
Bert Dobbelaere, Python program

The case of pairs is A015614.
The case of triples is A015617.
The non-maximal version counting empty sets and singletons is A084422.
The non-maximal version counting singletons is A187106.
The non-maximal version is A320426(n) = A276187(n) + 1.
The version for indivisibility instead of coprimality is A326077.
The version for sets of divisors is A343652.
The version for sets of divisors > 1 is A343660.
A018892 counts coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
Cf. A007360, A067824, A087087, A225520, A324837, A325683, A325859, A326358, A326496, A326675, A333227, A343653, A343655.

fasmax[y_]:=Complement[y,Union@@Most@*Subsets/@y];
Table[Length[fasmax[Select[Subsets[Range[n]],CoprimeQ@@#&]]],{n,15}]

More terms from Bert Dobbelaere, May 04 2021

A343657 Sum of number of divisors of x^y for each x >= 1, y >= 0, x + y = n.

Original entry on oeis.org

1, 2, 4, 7, 12, 18, 27, 39, 56, 77, 103, 134, 174, 223, 283, 356, 445, 547, 666, 802, 959, 1139, 1344, 1574, 1835, 2128, 2454, 2815, 3213, 3648, 4126, 4653, 5239, 5888, 6608, 7407, 8298, 9288, 10385, 11597, 12936, 14408, 16025, 17799, 19746, 21882, 24221

Offset: 1

Gus Wiseman, Apr 29 2021

nonn

			The a(7) = 27 divisors:
  1  32  81  64  25  6  1
     16  27  32  5   3
     8   9   16  1   2
     4   3   8       1
     2   1   4
     1       2
             1

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Antidiagonal row sums (row sums of the triangle) of A343656.
Dominated by A343661.
A000005(n) counts divisors of n.
A000312(n) = n^n.
A007318(n,k) counts k-sets of elements of {1..n}.
A009998(n,k) = n^k (as an array, offset 1).
A059481(n,k) counts k-multisets of elements of {1..n}.
A343658(n,k) counts k-multisets of divisors of n.
Cf. A000169, A000272, A002064, A002109, A048691, A062319, A066959, A143773, A146291, A176029, A251683, A282935, A326358, A327527, A334996.

Total/@Table[DivisorSigma[0,k^(n-k)],{n,30},{k,n}]

a(n) = Sum_{k=1..n} A000005(k^(n-k)).

A348260 Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements.

Original entry on oeis.org

1, 2, 3, 5, 10, 30, 233, 35925

Offset: 0

Dmitry I. Ignatov, Oct 13 2021

a(n) is the number of orbits for the corresponding families of maximal antichains (see also A326358) of the powerset of {1,2,...,n} under the action of the symmetry group S_n.

			The a(0)=1 maximal antichains is {}.
The a(1)=2 maximal antichains are {}, {1}.
The a(2)=3 maximal antichains {}, {1}{2}, {12}.
Representatives of the a(3)=5 maximal antichains are: {}, {1}{2}{3}, {12}{3}, {12}{13}{23}, {123}.
Representatives of the a(4)=10 maximal antichains are:
   {},                       {1}{2}{3}{4},
   {12}{3}{4},               {12}{13}{23}{4},
   {123}{4},                 {12}{13}{24}{14}{24}{34},
   {123}{14}{24}{34},        {123}{124}{34},
   {123}{124}{134}{234},     {1234}.

Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.
Dmitry I. Ignatov, Supporting iPython code and input files for generating and counting inequivalent maximal antichains for n up to 7 and related sequences, Github repository, sections 0,1,4
Dmitry I. Ignatov, Supporting iPython notebook: A348260.ipynb
Dmitry I. Ignatov, PDF of the supporting iPython notebook

Cf. A003182 (not necessarily maximal), A326358 (labeled case).

Cf. A326359, A326360.

A358041 The number of maximal antichains in the lattice of set partitions of an n-element set.

Original entry on oeis.org

1, 2, 3, 32, 14094

Offset: 1

Dmitry I. Ignatov, Oct 29 2022

Also similar to the number of maximal antichains in the Boolean lattice.

			For n = 3 the a(3) = 3 maximal antichains are: {1|2|3}, {1|23, 12|3, 13|2}, and {123}. We use the typical shorthand notation for set partitions where 1|23 denotes {{1}, {2,3}}.

R. L. Graham, Maximum antichains in the partition lattice, The Mathematical Intelligencer, 1 (1978), 84-86.
Dmitry I. Ignatov, A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions. In: Ojeda-Aciego, M., Sauerwald, K., Jäschke, R. (eds) Graph-Based Representation and Reasoning. ICCS 2023. Lecture Notes in Computer Science(). Springer, Cham.
Dmitry I. Ignatov, Supporting iPython code and input files for counting (maximal) antichains of the set partition lattice up to n=5, Github repository.

Cf. A302250 (number of antichains in the lattice of set partitions).

Cf. A326358 (number of maximal antichains in the Boolean lattice).

A358390 The number of maximal antichains in the Kreweras lattice of non-crossing set partitions of an n-element set.

Original entry on oeis.org

1, 2, 3, 25, 2117, 22581637702

Offset: 1

Dmitry I. Ignatov, Nov 13 2022

Also similar to the number of maximal antichains in the lattice of set partitions or in the Boolean lattice.

Dmitry I. Ignatov, Supporting iPython code and input files for counting (maximal) antichains of the non-crossing set partition lattice up to n=5, Github repository.
G. Kreweras, Sur les partitions non croisées d'un cycle, Discrete Math., 4(1972), 333-350.

Cf. A302250 (number of antichains in the lattice of set partitions).
Cf. A326358 (number of maximal antichains in the Boolean lattice).
Cf. A000108 (number of noncrossing partitions of a set of n elements)

A358563 The number of maximal antichains in the Tamari lattice of order n.

Original entry on oeis.org

1, 2, 4, 26, 1979, 161117453

Offset: 1

Dmitry I. Ignatov, Nov 22 2022

Also the number of maximal order ideals in the Tamari lattice of order n.

Maximal antichains are those which cannot be extended without violating the antichain condition.

			The line (Hasse) diagram of the Tamari lattice for n=3 is
     ((ab)c)d
      /     \
 (a(bc))d (ab)(cd)
     |       /
  a((bc)d)  /
      \    /
     a(b(cd))
with the a(3)=4 maximal antichains {((ab)c)d}, {(ab)(cd), (a(bc))d}, {(ab)(cd), a((bc)d)}, {a(b(cd))}.

D. Tamari, The algebra of bracketings and their enumeration, Nieuw Archief voor Wiskunde, Series 3, 10 (1962), 131-146.

S. Huang and D. Tamari, Problems of associativity: A simple proof for the lattice property of systems ordered by a semi-associative law, J. of Comb. Theory, Series A, 13 (1972), 7-13.
Dmitry I. Ignatov, Supporting iPython code and input files for counting (maximal) antichains of the Tamari partition lattice up to n=5, Github repository.
Wikipedia, Tamari lattice

Cf. A358562 (number of antichains in the Tamari lattice).
Cf. A326358 (number of maximal antichains in the Boolean lattice).
Cf. A358041 (number of maximal antichains in the lattice of set partitions of an n-element set).
Cf. A358390 (number of maximal antichains in the Kreweras lattice of non-crossing set partitions).
Cf. A143674 (number of maximal antichains in the lattice of Dyck paths).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A326360 Number of maximal antichains of nonempty, non-singleton subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A343659 Number of maximal pairwise coprime subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A343657 Sum of number of divisors of x^y for each x >= 1, y >= 0, x + y = n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A348260 Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A358041 The number of maximal antichains in the lattice of set partitions of an n-element set.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A358390 The number of maximal antichains in the Kreweras lattice of non-crossing set partitions of an n-element set.

Views

Author

Keywords

Comments

Links

Crossrefs

A358563 The number of maximal antichains in the Tamari lattice of order n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs