A316980 -id:A316980 - cp's OEIS frontend

A319638 Number of non-isomorphic weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.

1, 1, 1, 1, 1, 1, 2, 2, 3, 4, 7

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

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(10) = 7 antichains:
1:  {{1}}
2:  {{1},{2}}
3:  {{1},{2},{3}}
4:  {{1},{2},{3},{4}}
5:  {{1},{2},{3},{4},{5}}
6:  {{1,2},{1,3},{2,3}}
    {{1},{2},{3},{4},{5},{6}}
7:  {{1},{2,3},{2,4},{3,4}}
    {{1},{2},{3},{4},{5},{6},{7}}
8:  {{1,2},{1,3},{2,4},{3,4}}
    {{1},{2},{3,4},{3,5},{4,5}}
    {{1},{2},{3},{4},{5},{6},{7},{8}}
9:  {{1,2},{1,3},{1,4},{2,3,4}}
    {{1},{2,3},{2,4},{3,5},{4,5}}
    {{1},{2},{3},{4,5},{4,6},{5,6}}
    {{1},{2},{3},{4},{5},{6},{7},{8},{9}}
10: {{1,3},{2,4},{1,2,5},{3,4,5}}
    {{1},{2,3},{2,4},{2,5},{3,4,5}}
    {{1,2},{1,3},{2,4},{3,5},{4,5}}
    {{1,3},{1,4},{2,3},{2,4},{3,4}}
    {{1},{2},{3,4},{3,5},{4,6},{5,6}}
    {{1},{2},{3},{4},{5,6},{5,7},{6,7}}
    {{1},{2},{3},{4},{5},{6},{7},{8},{9},{10}}

Cf. A006126, A007716, A049311, A059201, A283877, A293606, A316980, A316983, A318099, A319558, A319616-A319646, A300913.

Euler transform of A319625.

A319641 Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of (not necessarily distinct) multisets.

Original entry on oeis.org

1, 1, 3, 5, 11, 18, 41, 70, 159, 323, 778

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

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(4) = 11 antichains:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{2}}
3: {{1,1,1}}
   {{1,2,3}}
   {{1},{2,2}}
   {{1},{2,3}}
   {{1},{2},{3}}
4: {{1,1,1,1}}
   {{1,1,2,2}}
   {{1,2,3,4}}
   {{1},{2,2,2}}
   {{1},{2,3,4}}
   {{1,1},{2,2}}
   {{1,2},{3,3}}
   {{1,2},{3,4}}
   {{1},{2},{3,3}}
   {{1},{2},{3,4}}
   {{1},{2},{3},{4}}

Cf. A006126, A007716, A049311, A059201, A283877, A293606, A316980, A316983, A318099, A319558, A319616-A319646.

Euler transform of A319628.

A319643 Number of non-isomorphic weight-n strict multiset partitions whose dual is an antichain of (not necessarily distinct) multisets.

Original entry on oeis.org

1, 1, 3, 6, 15, 29, 82, 179, 504, 1302, 3822

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
From Gus Wiseman, Aug 15 2019: (Start)
Also the number of non-isomorphic T_0 weak antichains of weight n. The T_0 condition means that the dual is strict (no repeated edges). A weak antichain is a multiset of multisets, none of which is a proper submultiset of any other. For example, non-isomorphic representatives of the a(0) = 1 through a(4) = 15 T_0 weak antichains are:
  {}  {{1}}  {{1,1}}    {{1,1,1}}      {{1,1,1,1}}
             {{1},{1}}  {{1,2,2}}      {{1,2,2,2}}
             {{1},{2}}  {{1},{2,2}}    {{1,1},{1,1}}
                        {{1},{1},{1}}  {{1,1},{2,2}}
                        {{1},{2},{2}}  {{1},{2,2,2}}
                        {{1},{2},{3}}  {{1,2},{2,2}}
                                       {{1},{2,3,3}}
                                       {{1,3},{2,3}}
                                       {{1},{1},{2,2}}
                                       {{1},{2},{3,3}}
                                       {{1},{1},{1},{1}}
                                       {{1},{1},{2},{2}}
                                       {{1},{2},{2},{2}}
                                       {{1},{2},{3},{3}}
                                       {{1},{2},{3},{4}}
(End)

			Non-isomorphic representatives of the a(1) = 1 through a(4) = 15 multiset partitions:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{2}}
3: {{1,1,1}}
   {{1,2,3}}
   {{1},{1,1}}
   {{1},{2,2}}
   {{1},{2,3}}
   {{1},{2},{3}}
4: {{1,1,1,1}}
   {{1,1,2,2}}
   {{1,2,3,4}}
   {{1},{1,1,1}}
   {{1},{1,2,2}}
   {{1},{2,2,2}}
   {{1},{2,3,4}}
   {{1,1},{2,2}}
   {{1,2},{3,3}}
   {{1,2},{3,4}}
   {{1},{2},{1,2}}
   {{1},{2},{2,2}}
   {{1},{2},{3,3}}
   {{1},{2},{3,4}}
   {{1},{2},{3},{4}}

Cf. A006126, A007716, A059201, A283877, A293606, A316980, A316983, A318099, A319558, A319616-A319646.

Cf. A245567, A293993, A319721, A326704, A326950, A326973, A326978.

A319644 Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of distinct multisets.

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 18, 31, 73, 162, 413

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

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) = 8 antichains:
1: {{1}}
2: {{1,1}}
   {{1},{2}}
3: {{1,1,1}}
   {{1},{2,2}}
   {{1},{2},{3}}
4: {{1,1,1,1}}
   {{1},{2,2,2}}
   {{1,1},{2,2}}
   {{1},{2},{3,3}}
   {{1},{2},{3},{4}}
5: {{1,1,1,1,1}}
   {{1},{2,2,2,2}}
   {{1,1},{1,2,2}}
   {{1,1},{2,2,2}}
   {{1},{2},{3,3,3}}
   {{1},{2,2},{3,3}}
   {{1},{2},{3},{4,4}}
   {{1},{2},{3},{4},{5}}

Cf. A006126, A007716, A049311, A059201, A283877, A293606, A316980, A316983, A318099, A319558, A319616-A319646.

Euler transform of A319629.

A319792 Number of non-isomorphic connected set systems of weight n with empty intersection.

Original entry on oeis.org

1, 0, 0, 0, 1, 2, 9, 22, 69, 190, 567, 1640, 5025, 15404, 49048, 159074, 531165, 1813627, 6352739, 22759620, 83443086, 312612543, 1196356133, 4672620842, 18615188819, 75593464871, 312729620542, 1317267618429, 5646454341658, 24618309943464, 109123789229297

Offset: 0

Gus Wiseman, Sep 27 2018

nonn

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

			Non-isomorphic representatives of the a(4) = 1 through a(6) = 9 connected set systems:
4:   {{1},{2},{1,2}}
5:  {{2},{3},{1,2,3}}
    {{2},{1,3},{2,3}}
6: {{1},{1,4},{2,3,4}}
   {{1},{2,3},{1,2,3}}
   {{3},{4},{1,2,3,4}}
   {{3},{1,4},{2,3,4}}
   {{1,2},{1,3},{2,3}}
   {{1,3},{2,4},{3,4}}
  {{1},{2},{3},{1,2,3}}
  {{1},{2},{1,3},{2,3}}
  {{2},{3},{1,3},{2,3}}

Andrew Howroyd, Table of n, a(n) for n = 0..50

Cf. A007716, A007718, A049311, A056156, A281116, A283877, A300913, A305854, A316980, A317752, A317755, A317757.

Cf. A319077, A319748, A319751, A319755, A319778, A319781, A319790.

a(n) = A300913(n) - A283877(n) + A319751(n). - Andrew Howroyd, May 31 2023

Terms a(11) and beyond from Andrew Howroyd, May 31 2023

A319793 Number of non-isomorphic connected strict multiset partitions (sets of multisets) of weight n with empty intersection.

Original entry on oeis.org

1, 0, 0, 0, 1, 4, 24, 96, 412, 1607, 6348, 24580, 96334, 378569, 1508220, 6079720, 24879878, 103335386, 436032901, 1869019800, 8139613977, 36008825317, 161794412893, 738167013847, 3418757243139, 16068569129711, 76622168743677, 370571105669576, 1817199912384794

Offset: 0

Gus Wiseman, Sep 27 2018

nonn

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(4) = 1 through a(5) = 4 multiset partitions:
4:  {{1},{2},{1,2}}
5: {{1},{2},{1,2,2}}
   {{1},{1,2},{2,2}}
   {{2},{3},{1,2,3}}
   {{2},{1,3},{2,3}}

Andrew Howroyd, Table of n, a(n) for n = 0..50

Cf. A007716, A007718, A056156, A281116, A283877, A316980, A317752, A317755, A317757, A319616.

Cf. A319077, A319748, A319755, A319778, A319781, A319791.

a(n) = A319557(n) - A316980(n) + A319077(n). - Andrew Howroyd, May 31 2023

Terms a(11) and beyond from Andrew Howroyd, May 31 2023

A330453 Number of strict multiset partitions of multiset partitions of integer partitions of n.

Original entry on oeis.org

1, 1, 3, 9, 23, 62, 161, 410, 1031, 2579, 6359, 15575, 37830, 91241, 218581, 520544, 1232431, 2902644, 6802178, 15866054, 36844016, 85202436, 196251933, 450341874, 1029709478, 2346409350, 5329371142, 12066816905, 27240224766, 61317231288, 137643961196

Offset: 0

Gus Wiseman, Dec 17 2019

nonn

Number of sets of nonempty multisets of nonempty multisets of positive integers with total sum n.

			The a(4) = 23 partitions:
  ((4))  ((22))    ((31))      ((211))        ((1111))
         ((2)(2))  ((1)(3))    ((1)(21))      ((1)(111))
                   ((1))((3))  ((2)(11))      ((11)(11))
                               ((1)(1)(2))    ((1))((111))
                               ((1))((21))    ((1)(1)(11))
                               ((2))((11))    ((1))((1)(11))
                               ((1))((1)(2))  ((1)(1)(1)(1))
                               ((2))((1)(1))  ((11))((1)(1))
                                              ((1))((1)(1)(1))

Alois P. Heinz, Table of n, a(n) for n = 0..3853

The not necessarily strict case is A007713.

Cf. A001055, A001970, A050336, A050343, A089259, A261049, A271619, A316980, A318566, A323787-A323795, A330452-A330459, A330461, A330463.

with(numtheory): with(combinat):
b:= proc(n) option remember; `if`(n=0, 1, add(add(d*
      numbpart(d), d=divisors(j))*b(n-j), j=1..n)/n)
    end:
a:= proc(n) a(n):= `if`(n<2, 1, add(a(n-k)*add(b(d)
      *d*(-1)^(k/d+1), d=divisors(k)), k=1..n)/n)
    end:
seq(a(n), n=0..32);  # Alois P. Heinz, Jul 18 2021

ppl[n_,k_]:=Switch[k,0,{n},1,IntegerPartitions[n],_,Join@@Table[Union[Sort/@Tuples[ppl[#,k-1]&/@ptn]],{ptn,IntegerPartitions[n]}]];
Table[Length[Select[ppl[n,3],UnsameQ@@#&]],{n,0,10}]

Weigh transform of A001970. The weigh transform of a sequence (s_1, s_2, ...) is the sequence with generating function Product_{i > 0} (1 + x^i)^s_i.

A319618 Number of non-isomorphic weight-n antichains of multisets whose dual is a chain of multisets.

Original entry on oeis.org

1, 1, 3, 4, 9, 10, 24, 28, 57, 80, 138

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

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(4) = 9 antichains:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{1}}
3: {{1,1,1}}
   {{1,2,2}}
   {{1,2,3}}
   {{1},{1},{1}}
4: {{1,1,1,1}}
   {{1,1,2,2}}
   {{1,2,2,2}}
   {{1,2,3,3}}
   {{1,2,3,4}}
   {{1,1},{1,1}}
   {{1,2},{1,2}}
   {{1,2},{2,2}}
   {{1},{1},{1},{1}}

Cf. A000219, A006126, A007716, A049311, A059201, A283877, A316980, A316983, A318099, A319558, A319616-A319646, A300913.

A319619 Number of non-isomorphic connected weight-n antichains of multisets whose dual is also an antichain of multisets.

Original entry on oeis.org

1, 1, 3, 3, 6, 4, 15, 13, 48, 96, 280

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

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) = 4 antichains:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{1}}
3: {{1,1,1}}
   {{1,2,3}}
   {{1},{1},{1}}
4: {{1,1,1,1}}
   {{1,1,2,2}}
   {{1,2,3,4}}
   {{1,1},{1,1}}
   {{1,2},{1,2}}
   {{1},{1},{1},{1}}
5: {{1,1,1,1,1}}
   {{1,2,3,4,5}}
   {{1,1},{1,2,2}}
   {{1},{1},{1},{1},{1}}

Cf. A006126, A007716, A007718, A056156, A059201, A316980, A316983, A318099, A319557, A319558, A319565, A319616-A319646, A300913.

Euler transform is A318099.

A319620 Number of connected antichain covers of n vertices by distinct sets whose dual is also a (not necessarily strict) antichain.

Original entry on oeis.org

1, 1, 1, 2, 22, 2133

Offset: 0

Gus Wiseman, Sep 25 2018

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,2}} is {{1},{1,2,2}}.

			The a(4) = 22 antichain covers:
   {{1,2,3,4}}
   {{3,4},{1,2,3},{1,2,4}}
   {{2,4},{1,2,3},{1,3,4}}
   {{2,3},{1,2,4},{1,3,4}}
   {{1,4},{1,2,3},{2,3,4}}
   {{1,3},{1,2,4},{2,3,4}}
   {{1,2},{1,3,4},{2,3,4}}
   {{1,3},{1,4},{2,3},{2,4}}
   {{1,2},{1,4},{2,3},{3,4}}
   {{1,2},{1,3},{2,4},{3,4}}
   {{1,4},{2,4},{3,4},{1,2,3}}
   {{1,3},{2,3},{3,4},{1,2,4}}
   {{1,2},{2,3},{2,4},{1,3,4}}
   {{1,2},{1,3},{1,4},{2,3,4}}
   {{1,3},{1,4},{2,3},{2,4},{3,4}}
   {{1,2},{1,4},{2,3},{2,4},{3,4}}
   {{1,2},{1,3},{2,3},{2,4},{3,4}}
   {{1,2},{1,3},{1,4},{2,4},{3,4}}
   {{1,2},{1,3},{1,4},{2,3},{3,4}}
   {{1,2},{1,3},{1,4},{2,3},{2,4}}
   {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}
   {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}

Cf. A006126, A007716, A007718, A049311, A056156, A059201, A283877, A316980, A316983, A318099, A319557, A319565, A319616-A319646, A300913.

cp's OEIS Frontend

A319638 Number of non-isomorphic weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A319641 Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of (not necessarily distinct) multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A319643 Number of non-isomorphic weight-n strict multiset partitions whose dual is an antichain of (not necessarily distinct) multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A319644 Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of distinct multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A319792 Number of non-isomorphic connected set systems of weight n with empty intersection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A319793 Number of non-isomorphic connected strict multiset partitions (sets of multisets) of weight n with empty intersection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A330453 Number of strict multiset partitions of multiset partitions of integer partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A319618 Number of non-isomorphic weight-n antichains of multisets whose dual is a chain of multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A319619 Number of non-isomorphic connected weight-n antichains of multisets whose dual is also an antichain of multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A319620 Number of connected antichain covers of n vertices by distinct sets whose dual is also a (not necessarily strict) antichain.