A326514 -id:A326514 - cp's OEIS frontend

A326026 Number of non-isomorphic multiset partitions of weight n where each part has a different length.

1, 1, 2, 7, 12, 35, 111, 247, 624, 1843, 6717, 15020, 46847, 124808, 412577, 1658973, 4217546, 12997734, 40786810, 126971940, 437063393, 2106317043, 5499108365, 19037901867, 59939925812, 210338815573, 683526043801, 2741350650705, 14848209030691, 41533835240731, 151548411269815

Offset: 0

Gus Wiseman, Jul 13 2019

nonn

The number of non-isomorphic multiset partitions of weight n is A007716(n).

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

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

Row sums of A332260.

Cf. A007716, A007837, A303546, A306017, A316980, A316983, A319560, A326514, A326517, A326533.

EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
D(p,n)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); my(u=EulerT(v)); polcoef(prod(k=1, #u, 1 + u[k]*x^k + O(x*x^n)), n)/prod(i=1, #v, i^v[i]*v[i]!)}
a(n)={my(s=0); forpart(p=n, s+=D(p,n)); s} \\ Andrew Howroyd, Feb 08 2020

Terms a(11) and beyond from Andrew Howroyd, Feb 08 2020

A326570 Number of covering antichains of subsets of {1..n} with different edge-sizes.

Original entry on oeis.org

2, 1, 1, 4, 17, 186, 3292, 139161, 14224121

Offset: 0

Gus Wiseman, Jul 18 2019

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}.

			The a(0) = 2 through a(4) = 17 antichains:
  {}    {{1}}  {{1,2}}  {{1,2,3}}    {{1,2,3,4}}
  {{}}                  {{1},{2,3}}  {{1},{2,3,4}}
                        {{2},{1,3}}  {{2},{1,3,4}}
                        {{3},{1,2}}  {{3},{1,2,4}}
                                     {{4},{1,2,3}}
                                     {{1,2},{1,3,4}}
                                     {{1,2},{2,3,4}}
                                     {{1,3},{1,2,4}}
                                     {{1,3},{2,3,4}}
                                     {{1,4},{1,2,3}}
                                     {{1,4},{2,3,4}}
                                     {{2,3},{1,2,4}}
                                     {{2,3},{1,3,4}}
                                     {{2,4},{1,2,3}}
                                     {{2,4},{1,3,4}}
                                     {{3,4},{1,2,3}}
                                     {{3,4},{1,2,4}}

Antichain covers are A006126.
Set partitions with different block sizes are A007837.
The case without singletons is A326569.
(Antichain) covers with equal edge-sizes are A306021.
Cf. A000372, A003182, A307249, A326026, A326514, A326566, A326572.

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]]]];
cleq[n_]:=Select[stableSets[Subsets[Range[n]],SubsetQ[#1,#2]||Length[#1]==Length[#2]&],Union@@#==Range[n]&];
Table[Length[cleq[n]],{n,0,6}]

a(8) from Andrew Howroyd, Aug 13 2019

A336138 Number of set partitions of the binary indices of n with distinct block-sums.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 2, 4, 1, 2, 2, 5, 2, 4, 5, 12, 1, 2, 2, 5, 2, 5, 4, 13, 2, 4, 5, 13, 5, 13, 13, 43, 1, 2, 2, 5, 2, 5, 5, 13, 2, 5, 4, 14, 5, 13, 14, 42, 2, 4, 5, 13, 5, 14, 13, 43, 5, 13, 14, 45, 14, 44, 44, 160, 1, 2, 2, 5, 2, 5, 5, 14, 2, 5, 5, 14, 4, 13

Offset: 0

Gus Wiseman, Jul 12 2020

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

			The a(n) set partitions for n = 3, 7, 11, 15, 23:
  {12}    {123}      {124}      {1234}        {1235}
  {1}{2}  {1}{23}    {1}{24}    {1}{234}      {1}{235}
          {13}{2}    {12}{4}    {12}{34}      {12}{35}
          {1}{2}{3}  {14}{2}    {123}{4}      {123}{5}
                     {1}{2}{4}  {124}{3}      {125}{3}
                                {13}{24}      {13}{25}
                                {134}{2}      {135}{2}
                                {1}{2}{34}    {15}{23}
                                {1}{23}{4}    {1}{2}{35}
                                {1}{24}{3}    {1}{25}{3}
                                {14}{2}{3}    {13}{2}{5}
                                {1}{2}{3}{4}  {15}{2}{3}
                                              {1}{2}{3}{5}

Gus Wiseman, Sequences counting and ranking multiset partitions whose part lengths, sums, or averages are constant or strict.

The version for twice-partitions is A271619.
The version for partitions of partitions is (also) A271619.
These set partitions are counted by A275780.
The version for factorizations is A321469.
The version for normal multiset partitions is A326519.
The version for equal block-sums is A336137.
Set partitions with distinct block-lengths are A007837.
Set partitions of binary indices are A050315.
Twice-partitions with equal sums are A279787.
Partitions of partitions with equal sums are A305551.
Normal multiset partitions with equal block-lengths are A317583.
Multiset partitions with distinct block-sums are ranked by A326535.
Cf. A000110, A032011, A035470, A131632, A321455, A326026, A326514, A326517, A326518, A326534, A326565.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[bpe[n]],UnsameQ@@Total/@#&]],{n,0,100}]

cp's OEIS Frontend

A326026 Number of non-isomorphic multiset partitions of weight n where each part has a different length.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A326570 Number of covering antichains of subsets of {1..n} with different edge-sizes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A336138 Number of set partitions of the binary indices of n with distinct block-sums.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica