A320800 -id:A320800 - cp's OEIS frontend

A321283 Number of non-isomorphic multiset partitions of weight n in which the part sizes are relatively prime.

1, 1, 2, 7, 21, 84, 214, 895, 2607, 9591, 31134, 119313, 400950, 1574123, 5706112, 22572991, 86933012, 356058243, 1427784135, 6044132304, 25342935667, 110414556330, 481712291885, 2166488898387, 9784077216457, 45369658599779, 211869746691055, 1011161497851296, 4871413403219085

Offset: 0

Gus Wiseman, Nov 06 2018

nonn

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which the row sums are relatively prime.
Also the number of non-isomorphic multiset partitions of weight n in which the multiset union of the parts is aperiodic, where a multiset is aperiodic if its multiplicities are relatively prime.
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) = 21 multiset partitions with relatively prime part-sizes:
  {{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}}
                    {{2},{1,2}}    {{1},{2,3,3}}
                    {{1},{1},{1}}  {{1},{2,3,4}}
                    {{1},{2},{2}}  {{2},{1,2,2}}
                    {{1},{2},{3}}  {{3},{1,2,3}}
                                   {{1},{1},{1,1}}
                                   {{1},{1},{2,2}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{1,2}}
                                   {{1},{2},{2,2}}
                                   {{1},{2},{3,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{1},{1},{1}}
                                   {{1},{1},{2},{2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}
Non-isomorphic representatives of the a(1) = 1 through a(4) = 21 multiset partitions with aperiodic multiset union:
  {{1}}  {{1,2}}    {{1,2,2}}      {{1,2,2,2}}
         {{1},{2}}  {{1,2,3}}      {{1,2,3,3}}
                    {{1},{2,2}}    {{1,2,3,4}}
                    {{1},{2,3}}    {{1},{2,2,2}}
                    {{2},{1,2}}    {{1,2},{2,2}}
                    {{1},{2},{2}}  {{1},{2,3,3}}
                    {{1},{2},{3}}  {{1,2},{3,3}}
                                   {{1},{2,3,4}}
                                   {{1,2},{3,4}}
                                   {{1,3},{2,3}}
                                   {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{2,2}}
                                   {{1},{2},{3,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,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. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303431, A303546, A303547, A320800-A320810.

\\ See links in A339645 for combinatorial species functions.
seq(n)={my(A=symGroupSeries(n)); NumUnlabeledObjsSeq(sCartProd(sExp(A), 1 + sum(d=1, n, moebius(d) * (-1 + sExp(O(x*x^n) + sum(i=1, n\d, polcoef(A,i*d)*x^(i*d)))) )))} \\ Andrew Howroyd, Jan 17 2023

\\ faster self contained program.
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))}
a(n)={if(n==0, 1, my(s=0); forpart(q=n, my(u=vector(n, t, K(q, t, n\t))); s+=permcount(q)*polcoef(sum(d=1, n, moebius(d)*exp(sum(t=1, n\d, sum(i=1, n\(t*d), u[t][i*d]*x^(i*d*t))/t, O(x*x^n)) )), n)); s/n!)} \\ Andrew Howroyd, Jan 17 2023

a(n) = A007716(n) - A320810(n). - Andrew Howroyd, Jan 17 2023

Terms a(11) and beyond from Andrew Howroyd, Jan 17 2023

A320806 Number of non-isomorphic multiset partitions of weight n in which each of the parts and each part of the dual, as well as both the multiset union of the parts and the multiset union of the dual parts, is an aperiodic multiset.

Original entry on oeis.org

1, 1, 1, 4, 10, 39, 81, 343, 903, 3223, 9989

Offset: 0

Gus Wiseman, Nov 07 2018

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which (1) the positive entries in each row and column are relatively prime and (2) the row sums and column sums are relatively prime.
The last condition (aperiodicity of the multiset union of the dual) is equivalent to the parts having relatively prime sizes.
A multiset is aperiodic if its multiplicities are relatively prime.
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 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) = 10 multiset partitions:
  {{1}}  {{1},{2}}  {{1},{2,3}}    {{1},{2,3,4}}
                    {{2},{1,2}}    {{2},{1,2,2}}
                    {{1},{2},{2}}  {{3},{1,2,3}}
                    {{1},{2},{3}}  {{1},{1},{2,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303546, A303707, A303708, A316983, A320800-A320810, A321283.

A320802 Number of non-isomorphic aperiodic multiset partitions of weight n whose dual is also an aperiodic multiset partition.

Original entry on oeis.org

1, 1, 2, 8, 26, 89, 274, 908, 2955, 9926, 34021, 119367, 428612, 1574222, 5914324, 22699632, 88997058, 356058538, 1453059643, 6044132792, 25612530061, 110503625785, 485161109305, 2166488899640, 9835209048655, 45370059225137, 212582814591083, 1011306624492831

Offset: 0

Gus Wiseman, Nov 06 2018

nonn

Also the number of nonnegative integer matrices with sum of entries equal to n and no zero rows or columns where the multiset of rows and the multiset of columns are both aperiodic, up to row and column permutations.
A multiset is aperiodic if its multiplicities are relatively prime.
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 weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
Also the number of non-isomorphic aperiodic multiset partitions of weight n whose parts have relatively prime periods, where the period of a multiset is the GCD of its multiplicities.

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

Jinyuan Wang, Table of n, a(n) for n = 0..50

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303431, A303546, A303547, A316983, A320800-A320810.

Second Moebius transform of A007716, or Moebius transform of A303546, where the Moebius transform of a sequence b is a(n) = Sum_{d|n} mu(d) * b(n/d).

a(26)-a(27) from Jinyuan Wang, Jun 27 2020

A320803 Number of non-isomorphic multiset partitions of weight n in which all parts are aperiodic multisets.

Original entry on oeis.org

1, 1, 3, 7, 21, 56, 174, 517, 1664, 5383, 18199, 62745, 223390, 813425, 3040181, 11620969, 45446484, 181537904, 740369798, 3079779662, 13059203150, 56406416004, 248027678362, 1109626606188, 5048119061134, 23342088591797, 109648937760252, 523036690273237

Offset: 0

Gus Wiseman, Nov 06 2018

nonn

A multiset is aperiodic if its multiplicities are relatively prime.

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) = 21 multiset partitions with aperiodic parts:
  {{1}}  {{1,2}}    {{1,2,2}}      {{1,2,2,2}}
         {{1},{1}}  {{1,2,3}}      {{1,2,3,3}}
         {{1},{2}}  {{1},{2,3}}    {{1,2,3,4}}
                    {{2},{1,2}}    {{1},{1,2,2}}
                    {{1},{1},{1}}  {{1,2},{1,2}}
                    {{1},{2},{2}}  {{1},{2,3,3}}
                    {{1},{2},{3}}  {{1},{2,3,4}}
                                   {{1,2},{3,4}}
                                   {{1,3},{2,3}}
                                   {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{1,2}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{1},{1},{1}}
                                   {{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. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303546, A303707, A303708, A303709, A303710, A320800-A320810.

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))}
a(n)={if(n==0, 1, my(mbt=vector(n, d, moebius(d)), s=0); forpart(q=n, s+=permcount(q)*polcoef(exp(x*Ser(dirmul(mbt, sum(t=1, n, K(q, t, n)/t)))), n)); s/n!)} \\ Andrew Howroyd, Jan 16 2023

Terms a(11) and beyond from Andrew Howroyd, Jan 16 2023

A320809 Number of non-isomorphic multiset partitions of weight n in which each part and each part of the dual, as well as the multiset union of the parts, is an aperiodic multiset.

Original entry on oeis.org

1, 1, 2, 5, 13, 40, 99, 344, 985, 3302, 10583

Offset: 0

Gus Wiseman, Nov 07 2018

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which (1) the positive entries in each row and column are relatively prime and (2) the column sums are relatively prime.
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}}.
A multiset is aperiodic if its multiplicities are relatively prime.
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) = 13 multiset partitions:
  {{1}}  {{1,2}}    {{1,2,3}}      {{1,2,3,4}}
         {{1},{2}}  {{1},{2,3}}    {{1},{2,3,4}}
                    {{2},{1,2}}    {{1,2},{3,4}}
                    {{1},{2},{2}}  {{1,3},{2,3}}
                    {{1},{2},{3}}  {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303546, A303707, A303708, A316983, A320800-A320810, A321283.

A321390 Third Moebius transform of A007716. Number of non-isomorphic aperiodic multiset partitions of weight n whose parts have relatively prime periods and whose dual is also an aperiodic multiset partition.

Original entry on oeis.org

1, 1, 1, 7, 24, 88, 265, 907, 2929, 9918, 33931, 119366, 428314, 1574221, 5913415, 22699536, 88994103, 356058537, 1453049451, 6044132791, 25612496016, 110503624870, 485160989937, 2166488899639, 9835208617114, 45370059225048

Offset: 0

Gus Wiseman, Nov 08 2018

nonn

The Moebius transform c of a sequence b is c(n) = Sum_{d|n} mu(d) * b(n/d).
Also the number of nonnegative integer matrices with sum of entries equal to n and no zero rows or columns where the multiset of rows and the multiset of columns are both aperiodic and the nonzero entries are relatively prime, up to row and column permutations.
A multiset is aperiodic if its multiplicities are relatively prime. The period of a multiset is the GCD of its multiplicities.
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 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) = 24 multiset partitions:
  {{1}}  {{1},{2}}  {{1,2,2}}      {{1,2,2,2}}
                    {{1},{1,1}}    {{1,2,3,3}}
                    {{1},{2,2}}    {{1},{1,1,1}}
                    {{1},{2,3}}    {{1},{1,2,2}}
                    {{2},{1,2}}    {{1},{2,2,2}}
                    {{1},{2},{2}}  {{1,2},{2,2}}
                    {{1},{2},{3}}  {{1},{2,3,3}}
                                   {{1,2},{3,3}}
                                   {{1},{2,3,4}}
                                   {{1,3},{2,3}}
                                   {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{1,1}}
                                   {{1},{1},{2,2}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{1,2}}
                                   {{1},{2},{2,2}}
                                   {{1},{2},{3,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303431, A303546, A303547, A316983, A320800-A320810.

A320805 Number of non-isomorphic multiset partitions of weight n in which each part, as well as the multiset union of the parts, is an aperiodic multiset.

Original entry on oeis.org

1, 1, 2, 6, 16, 55, 139, 516, 1500, 5269, 17017

Offset: 0

Gus Wiseman, Nov 07 2018

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which (1) the positive entries in each row are relatively prime and (2) the column sums are relatively prime.
A multiset is aperiodic if its multiplicities are relatively prime.
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) = 16 multiset partitions:
  {{1}}  {{1,2}}    {{1,2,2}}      {{1,2,2,2}}
         {{1},{2}}  {{1,2,3}}      {{1,2,3,3}}
                    {{1},{2,3}}    {{1,2,3,4}}
                    {{2},{1,2}}    {{1},{2,3,3}}
                    {{1},{2},{2}}  {{1},{2,3,4}}
                    {{1},{2},{3}}  {{1,2},{3,4}}
                                   {{1,3},{2,3}}
                                   {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303546, A303707, A303708, A303710, A320800-A320810, A321283.

A321409 Number of non-isomorphic self-dual multiset partitions of weight n whose part sizes are relatively prime.

Original entry on oeis.org

1, 1, 1, 3, 6, 16, 27, 71, 135, 309, 621

Offset: 0

Gus Wiseman, Nov 16 2018

Also the number of nonnegative integer symmetric matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, with relatively prime row sums (or column sums).
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 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) = 16 multiset partitions:
  {{1}}  {{1}{2}}  {{1}{22}}    {{1}{222}}      {{11}{122}}
                   {{2}{12}}    {{2}{122}}      {{11}{222}}
                   {{1}{2}{3}}  {{1}{1}{23}}    {{12}{122}}
                                {{1}{2}{33}}    {{1}{2222}}
                                {{1}{3}{23}}    {{2}{1222}}
                                {{1}{2}{3}{4}}  {{1}{22}{33}}
                                                {{1}{23}{23}}
                                                {{1}{2}{333}}
                                                {{1}{3}{233}}
                                                {{2}{12}{33}}
                                                {{2}{13}{23}}
                                                {{3}{3}{123}}
                                                {{1}{2}{2}{34}}
                                                {{1}{2}{3}{44}}
                                                {{1}{2}{4}{34}}
                                                {{1}{2}{3}{4}{5}}

Cf. A000219, A007716, A120733, A138178, A316983, A319616.

Cf. A320796, A320797, A320800, A320805, A320806, A320809, A320811, A320813, A321283, A321410, A321411, A321413.

A320807 Number of non-isomorphic multiset partitions of weight n in which all parts are aperiodic and all parts of the dual are also aperiodic.

Original entry on oeis.org

1, 1, 3, 6, 17, 41, 122, 345, 1077, 3385, 11214

Offset: 0

Gus Wiseman, Nov 07 2018

Also the number of nonnegative integer matrices up to row and column permutations with sum of entries equal to n and no zero rows or columns, in which each row and each column has relatively prime nonzero entries.
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}}.
A multiset is aperiodic if its multiplicities are relatively prime.
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) = 17 multiset partitions:
  {{1}}  {{1,2}}    {{1,2,3}}      {{1,2,3,4}}
         {{1},{1}}  {{1},{2,3}}    {{1,2},{1,2}}
         {{1},{2}}  {{2},{1,2}}    {{1},{2,3,4}}
                    {{1},{1},{1}}  {{1,2},{3,4}}
                    {{1},{2},{2}}  {{1,3},{2,3}}
                    {{1},{2},{3}}  {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{1,2}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{1},{1},{1}}
                                   {{1},{1},{2},{2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303546, A303707, A303708, A316983, A320800-A320810.

cp's OEIS Frontend

A321283 Number of non-isomorphic multiset partitions of weight n in which the part sizes are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions

A320806 Number of non-isomorphic multiset partitions of weight n in which each of the parts and each part of the dual, as well as both the multiset union of the parts and the multiset union of the dual parts, is an aperiodic multiset.

Views

Author

Keywords

Comments

Examples

Crossrefs

A320802 Number of non-isomorphic aperiodic multiset partitions of weight n whose dual is also an aperiodic multiset partition.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A320803 Number of non-isomorphic multiset partitions of weight n in which all parts are aperiodic multisets.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A320809 Number of non-isomorphic multiset partitions of weight n in which each part and each part of the dual, as well as the multiset union of the parts, is an aperiodic multiset.

Views

Author

Keywords

Comments

Examples

Crossrefs

A321390 Third Moebius transform of A007716. Number of non-isomorphic aperiodic multiset partitions of weight n whose parts have relatively prime periods and whose dual is also an aperiodic multiset partition.

Views

Author

Keywords

Comments

Examples

Crossrefs

A320805 Number of non-isomorphic multiset partitions of weight n in which each part, as well as the multiset union of the parts, is an aperiodic multiset.

Views

Author

Keywords

Comments

Examples

Crossrefs

A321409 Number of non-isomorphic self-dual multiset partitions of weight n whose part sizes are relatively prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

A320807 Number of non-isomorphic multiset partitions of weight n in which all parts are aperiodic and all parts of the dual are also aperiodic.

Views

Author

Keywords

Comments

Examples

Crossrefs