A320799 -id:A320799 - cp's OEIS frontend

A320797 Number of non-isomorphic self-dual multiset partitions of weight n with no singletons.

1, 0, 1, 1, 3, 4, 9, 15, 33, 60, 121

Offset: 0

Gus Wiseman, Nov 02 2018

Also the number of nonnegative integer square symmetric matrices with sum of elements equal to n and no rows or columns summing to 0 or 1, up to row and column permutations.

			Non-isomorphic representatives of the a(2) = 1 through a(7) = 15 multiset partitions:
  {{11}}  {{111}}  {{1111}}    {{11111}}    {{111111}}      {{1111111}}
                   {{11}{22}}  {{11}{122}}  {{111}{222}}    {{111}{1222}}
                   {{12}{12}}  {{11}{222}}  {{112}{122}}    {{111}{2222}}
                               {{12}{122}}  {{11}{2222}}    {{112}{1222}}
                                            {{12}{1222}}    {{11}{22222}}
                                            {{22}{1122}}    {{12}{12222}}
                                            {{11}{22}{33}}  {{122}{1122}}
                                            {{11}{23}{23}}  {{22}{11222}}
                                            {{12}{13}{23}}  {{11}{12}{233}}
                                                            {{11}{22}{233}}
                                                            {{11}{22}{333}}
                                                            {{11}{23}{233}}
                                                            {{12}{12}{333}}
                                                            {{12}{13}{233}}
                                                            {{13}{23}{123}}
Inequivalent representatives of the a(6) = 9 symmetric matrices with no rows or columns summing to 1:
  [6]
.
  [3 0]  [2 1]  [4 0]  [3 1]  [2 2]
  [0 3]  [1 2]  [0 2]  [1 1]  [2 0]
.
  [2 0 0]  [2 0 0]  [1 1 0]
  [0 2 0]  [0 1 1]  [1 0 1]
  [0 0 2]  [0 1 1]  [0 1 1]

Cf. A000219, A007716, A302545, A316980, A316983, A319560, A319616, A319721.

Cf. A320796, A320798, A320799, A320804, A320811, A320812, A320813.

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.

A321184 Number of integer partitions of n that are the vertex-degrees of some multiset of nonempty sets, none of which is a proper subset of any other, with no singletons.

Original entry on oeis.org

1, 0, 1, 1, 3, 2, 7, 6, 15, 15, 30

Offset: 0

Gus Wiseman, Oct 29 2018

			The a(2) = 1 through a(8) = 15 partitions:
  (11)  (111)  (22)    (2111)   (33)      (2221)     (44)
               (211)   (11111)  (222)     (3211)     (332)
               (1111)           (321)     (22111)    (422)
                                (2211)    (31111)    (431)
                                (3111)    (211111)   (2222)
                                (21111)   (1111111)  (3221)
                                (111111)             (3311)
                                                     (4211)
                                                     (22211)
                                                     (32111)
                                                     (41111)
                                                     (221111)
                                                     (311111)
                                                     (2111111)
                                                     (11111111)
The a(6) = 7 integer partitions together with a realizing multi-antichain of each (the parts of the partition count the appearances of each vertex in the multi-antichain):
      (33): {{1,2},{1,2},{1,2}}
     (321): {{1,2},{1,2},{1,3}}
    (3111): {{1,2},{1,3},{1,4}}
     (222): {{1,2,3},{1,2,3}}
    (2211): {{1,2,3},{1,2,4}}
   (21111): {{1,2},{1,3,4,5}}
  (111111): {{1,2,3,4,5,6}}

Cf. A000070, A000569, A006126, A096827, A147878, A209816, A283877, A318360, A319719, A319721, A320799, A320921, A321176.

sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
multanti[m_]:=Select[mps[m],And[And@@UnsameQ@@@#,Min@@Length/@#>1,stableQ[#]]&];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
Table[Length[Select[strnorm[n],multanti[#]!={}&]],{n,8}]

A321678 Number of non-isomorphic weight-n strict antichains of sets with no singletons.

Original entry on oeis.org

1, 0, 1, 1, 3, 3, 11, 13, 39, 67, 174

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

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

cp's OEIS Frontend

A320797 Number of non-isomorphic self-dual multiset partitions of weight n with no singletons.

Views

Author

Keywords

Comments

Examples

Crossrefs

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

Views

Author

Keywords

Comments

Examples

Crossrefs

A321184 Number of integer partitions of n that are the vertex-degrees of some multiset of nonempty sets, none of which is a proper subset of any other, with no singletons.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A321678 Number of non-isomorphic weight-n strict antichains of sets with no singletons.

Views

Author

Keywords

Comments

Examples

Crossrefs