A317752 -id:A317752 - cp's OEIS frontend

A317757 Number of non-isomorphic multiset partitions of size n such that the blocks have empty intersection.

1, 0, 1, 4, 17, 56, 205, 690, 2446, 8506, 30429, 109449, 402486, 1501424, 5714194, 22132604, 87383864, 351373406, 1439320606, 6003166059, 25488902820, 110125079184, 483987225922, 2162799298162, 9823464989574, 45332196378784, 212459227340403, 1010898241558627, 4881398739414159

Offset: 0

Gus Wiseman, Aug 06 2018

nonn

			Non-isomorphic representatives of the a(4) = 17 multiset partitions:
  {1}{234},{2}{111},{2}{113},{11}{22},{11}{23},{12}{34},
  {1}{1}{22},{1}{1}{23},{1}{2}{11},{1}{2}{12},{1}{2}{13},{1}{2}{34},{2}{3}{11},
  {1}{1}{1}{2},{1}{1}{2}{2},{1}{1}{2}{3},{1}{2}{3}{4}.

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

Cf. A007716, A035310, A255906, A281116, A317073, A317533.
Cf. A317748, A317751, A317752, A317755.
Cf. A319077, A319748, A319755, A319778, A319781, A319790.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
sysnorm[m_]:=If[Union@@m!=Range[Max@@Flatten[m]],sysnorm[m/.Rule@@@Table[{(Union@@m)[[i]],i},{i,Length[Union@@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]]}]])]];
Table[Length[Union[sysnorm/@Join@@Table[Select[mps[m],Intersection@@#=={}&],{m,strnorm[n]}]]],{n,6}]

EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={EulerT(Vec(sum(j=1, #q, gcd(t, q[j])*x^lcm(t, q[j])) + O(x*x^k), -k))}
R(q, n)={vector(n, t, x*Ser(K(q, t, n)/t))}
a(n)={my(s=0); forpart(q=n, my(f=prod(i=1, #q, 1 - x^q[i]), u=R(q,n)); s+=permcount(q)*sum(k=0, n, my(c=polcoef(f,k)); if(c, c*polcoef(exp(sum(t=1, n\(k+1), x^(t*k)*u[t], O(x*x^n) ))/if(k,1-x^k,1), n))) ); s/n!} \\ Andrew Howroyd, May 30 2023

a(8)-a(10) from Gus Wiseman, Sep 27 2018

a(0)=1 prepended and terms a(11) and beyond from Andrew Howroyd, May 30 2023

A317755 Number of multiset partitions of strongly normal multisets of size n such that the blocks have empty intersection.

Original entry on oeis.org

0, 1, 6, 30, 130, 629, 2930, 15019, 78224, 438626, 2548481

Offset: 1

Gus Wiseman, Aug 06 2018

A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities.

			The a(3) = 6 strongly normal multiset partitions with empty intersection:
  {{2},{1,1}}
  {{1},{2,3}}
  {{2},{1,3}}
  {{3},{1,2}}
  {{1},{1},{2}}
  {{1},{2},{3}}

Cf. A007716, A035310, A255906, A317073, A281116, A317077, A317078, A317532, A317533.

Cf. A317748, A317751, A317752, A317757, A317775.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
Table[Length[Join@@Table[Select[mps[m],Intersection@@#=={}&],{m,strnorm[n]}]],{n,6}]

a(10)-a(11) from Robert Price, May 08 2021

A319781 Number of multiset partitions of integer partitions of n with empty intersection. Number of relatively prime factorizations of Heinz numbers of integer partitions of n.

Original entry on oeis.org

1, 0, 0, 1, 3, 9, 21, 48, 103, 214, 436, 863, 1689

Offset: 0

Gus Wiseman, Sep 27 2018

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

			The a(3) = 1 through a(5) = 9 multiset partitions:
3: {{1},{2}}
4: {{1},{3}}
   {{2},{1,1}}
   {{1},{1},{2}}
5: {{1},{4}}
   {{2},{3}}
   {{3},{1,1}}
   {{1},{2,2}}
   {{1},{1},{3}}
   {{1},{2},{2}}
   {{2},{1,1,1}}
   {{1},{2},{1,1}}
   {{1},{1},{1},{2}}

Cf. A007716, A049311, A281116, A283877, A316980, A317752, A317755, A317757, A318715.

Cf. A319775, A319779, A319778, A319783.

A317776 Number of strict multiset partitions of normal multisets of size n, where a multiset is normal if it spans an initial interval of positive integers.

Original entry on oeis.org

1, 1, 3, 13, 59, 313, 1847, 11977, 84483, 642405, 5228987, 45297249, 415582335, 4021374193, 40895428051, 435721370413, 4850551866619, 56282199807401, 679220819360775, 8508809310177481, 110454586096508563, 1483423600240661781, 20581786429087269819

Offset: 0

Gus Wiseman, Aug 06 2018

nonn

			The a(3) = 13 strict multiset partitions:
  {{1,1,1}}, {{1},{1,1}},
  {{1,2,2}}, {{1},{2,2}}, {{2},{1,2}},
  {{1,1,2}}, {{1},{1,2}}, {{2},{1,1}},
  {{1,2,3}}, {{1},{2,3}}, {{2},{1,3}}, {{3},{1,2}}, {{1},{2},{3}}.

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

Cf. A001055, A007716, A045778, A255906, A281116, A317449, A317532, A317583, A317653, A317752, A317757, A317775.

Row sums of A327116.

C:= binomial:
b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
      b(n-i*j, min(n-i*j, i-1), k)*C(C(k+i-1, i), j), j=0..n/i)))
    end:
a:= n-> add(add(b(n$2, i)*(-1)^(k-i)*C(k, i), i=0..k), k=0..n):
seq(a(n), n=0..23);  # Alois P. Heinz, Sep 16 2019

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]]]];
allnorm[n_Integer]:=Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1];
Table[Length[Select[Join@@mps/@allnorm[n],UnsameQ@@#&]],{n,9}]
(* Second program: *)
c := Binomial;
b[n_, i_, k_] := b[n, i, k] = If[n==0, 1, If[i<1, 0, Sum[b[n - i*j, Min[n - i*j, i-1], k] c[c[k+i-1, i], j], {j, 0, n/i}]]];
a[n_] := Sum[b[n, n, i] (-1)^(k-i) c[k, i], {k, 0, n}, {i, 0, k}];
a /@ Range[0, 23] (* Jean-François Alcover, Dec 17 2020, after Alois P. Heinz *)

a(0), a(8)-a(22) from Alois P. Heinz, Sep 16 2019

A319778 Number of non-isomorphic set systems of weight n with empty intersection whose dual is also a set system with empty intersection.

Original entry on oeis.org

1, 0, 1, 1, 2, 5, 13, 28, 72, 181, 483

Offset: 0

Gus Wiseman, Sep 27 2018

The dual of a multiset partition has, for each vertex, one part consisting of the indices (or positions) of the parts containing that vertex, counted with multiplicity. For example, the dual of {{1,2},{2,2}} is {{1},{1,2,2}}. The dual of a multiset partition has empty intersection iff no part contains all the vertices.

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

Cf. A007716, A049311, A281116, A283877, A316980, A317752, A317755, A317757.

Cf. A319775, A319779, A319781, A319783.

A326912 BII-numbers of pairwise intersecting set-systems with empty intersection.

Original entry on oeis.org

0, 52, 116, 772, 832, 836, 1072, 1076, 1136, 1140, 1796, 1856, 1860, 2320, 2368, 2384, 2592, 2624, 2656, 2880, 3088, 3104, 3120, 3136, 3152, 3168, 3184, 3344, 3392, 3408, 3616, 3648, 3680, 3904, 4132, 4148, 4196, 4212, 4612, 4640, 4644, 4672, 4676, 4704, 4708

Offset: 1

Gus Wiseman, Aug 04 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every finite set of finite nonempty sets has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

			The sequence of all pairwise intersecting set-systems with empty intersection, together with their BII-numbers, begins:
     0: {}
    52: {{1,2},{1,3},{2,3}}
   116: {{1,2},{1,3},{2,3},{1,2,3}}
   772: {{1,2},{1,4},{2,4}}
   832: {{1,2,3},{1,4},{2,4}}
   836: {{1,2},{1,2,3},{1,4},{2,4}}
  1072: {{1,3},{2,3},{1,2,4}}
  1076: {{1,2},{1,3},{2,3},{1,2,4}}
  1136: {{1,3},{2,3},{1,2,3},{1,2,4}}
  1140: {{1,2},{1,3},{2,3},{1,2,3},{1,2,4}}
  1796: {{1,2},{1,4},{2,4},{1,2,4}}
  1856: {{1,2,3},{1,4},{2,4},{1,2,4}}
  1860: {{1,2},{1,2,3},{1,4},{2,4},{1,2,4}}
  2320: {{1,3},{1,4},{3,4}}
  2368: {{1,2,3},{1,4},{3,4}}
  2384: {{1,3},{1,2,3},{1,4},{3,4}}
  2592: {{2,3},{2,4},{3,4}}
  2624: {{1,2,3},{2,4},{3,4}}
  2656: {{2,3},{1,2,3},{2,4},{3,4}}
  2880: {{1,2,3},{1,4},{2,4},{3,4}}

Cf. A048793, A051185, A305843, A317752, A317755, A317757, A319077, A326031, A326910, A326911.

Cf. A318715, A319759, A319762, A319763, A319764.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,1000],(#==0||Intersection@@bpe/@bpe[#]=={})&&stableQ[bpe/@bpe[#],Intersection[#1,#2]=={}&]&]

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

Original entry on oeis.org

1, 0, 1, 3, 12, 37, 130, 428, 1481, 5091, 17979, 64176, 234311, 869645, 3295100, 12720494, 50083996, 200964437, 821845766, 3423694821, 14524845181, 62725701708, 275629610199, 1231863834775, 5597240308384, 25844969339979, 121224757935416, 577359833539428, 2791096628891679

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(2) = 1 through a(4) = 12 strict multiset partitions with empty intersection:
2: {{1},{2}}
3: {{1},{2,2}}
   {{1},{2,3}}
   {{1},{2},{3}}
4: {{1},{2,2,2}}
   {{1},{2,3,3}}
   {{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},{3},{2,3}}
   {{1},{2},{3},{4}}

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

Cf. A007716, A049311, A281116, A283877, A316980, A317752, A317755, A317757, A318715.

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

EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={EulerT(Vec(sum(j=1, #q, my(g=gcd(t, q[j])); g*x^(q[j]/g)) + O(x*x^k), -k))}
R(q, n)={vector(n, t, subst(x*Ser(K(q, t, n\t)/t), x, x^t))}
a(n)={my(s=0); forpart(q=n, my(f=prod(i=1, #q, 1 - x^q[i]), u=R(q,n)); s+=permcount(q)*sum(k=0, n, my(c=polcoef(f,k)); if(c, c*polcoef(exp(sum(t=1, n\(k+1), x^(t*k)*u[t] - subst(x^(t*k)*u[t] + O(x*x^(n\2)), x, x^2), O(x*x^n) ))*if(k,1+x^k,1), n))) ); s/n!} \\ Andrew Howroyd, May 30 2023

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

A319748 Number of non-isomorphic set multipartitions (multisets of sets) of weight n with empty intersection.

Original entry on oeis.org

1, 0, 1, 3, 10, 25, 72, 182, 502, 1332, 3720, 10380, 30142, 88842, 270569, 842957, 2703060, 8885029, 29990388, 103743388, 367811233, 1334925589, 4957151327, 18817501736, 72972267232, 288863499000, 1166486601571, 4802115258807, 20141268290050, 86017885573548, 373852868791639

Offset: 0

Gus Wiseman, Sep 27 2018

nonn

The weight of a set multipartition 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(4) = 10 set multipartitions:
  {{1},{2}}   {{1},{2,3}}     {{1},{2,3,4}}
             {{1},{2},{2}}    {{1,2},{3,4}}
             {{1},{2},{3}}   {{1},{1},{2,3}}
                             {{1},{2},{1,2}}
                             {{1},{2},{3,4}}
                             {{1},{3},{2,3}}
                            {{1},{1},{2},{2}}
                            {{1},{2},{2},{2}}
                            {{1},{2},{3},{3}}
                            {{1},{2},{3},{4}}

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

Cf. A007716, A049311, A281116, A283877, A316980, A317752, A317755, A317757, A319616.

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

WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={WeighT(Vec(sum(j=1, #q, gcd(t, q[j])*x^lcm(t, q[j])) + O(x*x^k), -k))}
R(q, n)={vector(n, t, x*Ser(K(q, t, n)/t))}
a(n)={if(n==0, 1, my(s=0); forpart(q=n, my(u=R(q,n)); s+=permcount(q)*polcoef(exp(sum(t=1, n, u[t], O(x*x^n))) - exp(sum(t=1, n\2, x^t*u[t], O(x*x^n)))/(1-x), n)); s/n!)} \\ Andrew Howroyd, May 30 2023

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

A319787 Number of intersecting multiset partitions of normal multisets of size n.

Original entry on oeis.org

1, 1, 3, 8, 27, 95, 373, 1532, 6724

Offset: 0

Gus Wiseman, Sep 27 2018

A multiset is normal if it spans an initial interval of positive integers.

A multiset partition is intersecting iff no two parts are disjoint.

			The a(1) = 1 through a(3) = 8 multiset partitions:
1: {{1}}
2: {{1,1}}
   {{1,2}}
   {{1},{1}}
3: {{1,1,1}}
   {{1,2,2}}
   {{1,1,2}}
   {{1,2,3}}
   {{1},{1,1}}
   {{2},{1,2}}
   {{1},{1,2}}
   {{1},{1},{1}}

Cf. A007716, A049311, A283877, A305854, A306006, A316980, A317752.

Cf. A319755, A319759, A319760, A319765, A319779, A319787, A319782, A319784, A319789.

A317748 Irregular triangle where T(n,k) is the number of factorizations of n into factors > 1 with GCD d = A027750(n, k).

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 3, 1, 0, 1, 0, 1, 2, 0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 3, 3, 0, 0, 0, 0, 0, 1, 0, 1, 1

Offset: 1

Gus Wiseman, Aug 06 2018

			Triangle begins:
   1:  0
   2:  0  1
   3:  0  1
   4:  0  1  1
   5:  0  1
   6:  1  0  0  1
   7:  0  1
   8:  0  2  0  1
   9:  0  1  1
  10:  1  0  0  1
  11:  0  1
  12:  2  1  0  0  0  1
  13:  0  1
  14:  1  0  0  1
  15:  1  0  0  1
  16:  0  3  1  0  1
  17:  0  1
  18:  2  0  1  0  0  1
  19:  0  1
  20:  2  1  0  0  0  1

Row lengths are A000005. Row sums are A001055. First column is A281116. Number of nonzero terms in each row is A317751.
Cf. A007562, A007716, A014963, A027750, A045778, A050370, A162247, A289509, A303386, A303546.
Cf. A317752, A317755, A317757.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
goc[n_,m_]:=Length[Select[facs[n],And[And@@(Divisible[#,m]&/@#),GCD@@(#/m)==1]&]];
Table[goc[n,d],{n,30},{d,Divisors[n]}]

Name edited by Peter Munn, Mar 05 2025

cp's OEIS Frontend

A317757 Number of non-isomorphic multiset partitions of size n such that the blocks have empty intersection.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A317755 Number of multiset partitions of strongly normal multisets of size n such that the blocks have empty intersection.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A319781 Number of multiset partitions of integer partitions of n with empty intersection. Number of relatively prime factorizations of Heinz numbers of integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A317776 Number of strict multiset partitions of normal multisets of size n, where a multiset is normal if it spans an initial interval of positive integers.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A319778 Number of non-isomorphic set systems of weight n with empty intersection whose dual is also a set system with empty intersection.

Views

Author

Keywords

Comments

Examples

Crossrefs

A326912 BII-numbers of pairwise intersecting set-systems with empty intersection.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A319748 Number of non-isomorphic set multipartitions (multisets of sets) of weight n with empty intersection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A319787 Number of intersecting multiset partitions of normal multisets of size n.

Views