A138178 -id:A138178 - cp's OEIS frontend

A321403 Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n.

1, 1, 1, 2, 4, 6, 10, 17, 32, 56, 98, 177, 335, 620, 1164, 2231, 4349, 8511, 16870, 33844, 68746, 140894, 291698, 610051, 1288594, 2745916, 5903988, 12805313, 28010036, 61764992, 137281977, 307488896, 693912297, 1577386813, 3611241900, 8324940862, 19321470086

Offset: 0

Gus Wiseman, Nov 15 2018

nonn

Also the number of symmetric (0,1)-matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns.
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(7) = 17 set multipartitions:
  {{1}}  {{1},{2}}  {{2},{1,2}}    {{1,2},{1,2}}      {{1},{2,3},{2,3}}
                    {{1},{2},{3}}  {{1},{1},{2,3}}    {{2},{1,3},{2,3}}
                                   {{1},{3},{2,3}}    {{3},{3},{1,2,3}}
                                   {{1},{2},{3},{4}}  {{1},{2},{2},{3,4}}
                                                      {{1},{2},{4},{3,4}}
                                                      {{1},{2},{3},{4},{5}}
.
  {{1,2},{1,3},{2,3}}        {{1,3},{2,3},{1,2,3}}
  {{3},{2,3},{1,2,3}}        {{1},{1},{1,4},{2,3,4}}
  {{1},{1},{1},{2,3,4}}      {{1},{2,3},{2,4},{3,4}}
  {{1},{2},{3,4},{3,4}}      {{1},{4},{3,4},{2,3,4}}
  {{1},{3},{2,4},{3,4}}      {{2},{1,2},{3,4},{3,4}}
  {{1},{4},{4},{2,3,4}}      {{2},{1,3},{2,4},{3,4}}
  {{2},{4},{1,2},{3,4}}      {{3},{4},{1,4},{2,3,4}}
  {{1},{2},{3},{3},{4,5}}    {{4},{4},{4},{1,2,3,4}}
  {{1},{2},{3},{5},{4,5}}    {{1},{1},{5},{2,3},{4,5}}
  {{1},{2},{3},{4},{5},{6}}  {{1},{2},{2},{2},{3,4,5}}
                             {{1},{2},{3},{4,5},{4,5}}
                             {{1},{2},{4},{3,5},{4,5}}
                             {{1},{2},{5},{5},{3,4,5}}
                             {{1},{3},{5},{2,3},{4,5}}
                             {{1},{2},{3},{4},{4},{5,6}}
                             {{1},{2},{3},{4},{6},{5,6}}
                             {{1},{2},{3},{4},{5},{6},{7}}
Inequivalent representatives of the a(6) = 10 matrices:
  [0 0 1] [1 1 0]
  [0 1 1] [1 0 1]
  [1 1 1] [0 1 1]
.
  [1 0 0 0] [1 0 0 0] [1 0 0 0] [1 0 0 0] [0 1 0 0]
  [1 0 0 0] [0 1 0 0] [0 0 1 0] [0 0 0 1] [0 0 0 1]
  [1 0 0 0] [0 0 1 1] [0 1 0 1] [0 0 0 1] [1 1 0 0]
  [0 1 1 1] [0 0 1 1] [0 0 1 1] [0 1 1 1] [0 0 1 1]
.
  [1 0 0 0 0] [1 0 0 0 0]
  [0 1 0 0 0] [0 1 0 0 0]
  [0 0 1 0 0] [0 0 1 0 0]
  [0 0 1 0 0] [0 0 0 0 1]
  [0 0 0 1 1] [0 0 0 1 1]
.
  [1 0 0 0 0 0]
  [0 1 0 0 0 0]
  [0 0 1 0 0 0]
  [0 0 0 1 0 0]
  [0 0 0 0 1 0]
  [0 0 0 0 0 1]

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

Cf. A007716, A049311, A135588, A135589, A138178, A283877, A316983, A319616.

Cf. A320796, A320797, A321403, A321404, A321405.

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}
c(p, k)={polcoef((prod(i=2, #p, prod(j=1, i-1, (1 + x^(2*lcm(p[i], p[j])) + O(x*x^k))^gcd(p[i], p[j]))) * prod(i=1, #p, my(t=p[i]); (1 + x^t + O(x*x^k))^(t%2)*(1 + x^(2*t) + O(x*x^k))^(t\2) )), k)}
a(n)={my(s=0); forpart(p=n, s+=permcount(p)*c(p, n)); s/n!} \\ Andrew Howroyd, May 31 2023

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

A321404 Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n with no singletons.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 1, 1, 3, 4, 6

Offset: 0

Gus Wiseman, Nov 15 2018

Also the number of 0-1 symmetric matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which no row sums to 1.
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(4) = 1 through a(10) = 6 set multipartitions:
   4: {{1,2},{1,2}}
   6: {{1,2},{1,3},{2,3}}
   7: {{1,3},{2,3},{1,2,3}}
   8: {{2,3},{1,2,3},{1,2,3}}
   8: {{1,2},{1,2},{3,4},{3,4}}
   8: {{1,2},{1,3},{2,4},{3,4}}
   9: {{1,2,3},{1,2,3},{1,2,3}}
   9: {{1,2},{1,2},{3,4},{2,3,4}}
   9: {{1,2},{1,3},{1,4},{2,3,4}}
   9: {{1,2},{1,4},{3,4},{2,3,4}}
  10: {{1,2},{1,2},{1,3,4},{2,3,4}}
  10: {{1,2},{2,4},{1,3,4},{2,3,4}}
  10: {{1,3},{2,4},{1,3,4},{2,3,4}}
  10: {{1,4},{2,4},{3,4},{1,2,3,4}}
  10: {{1,2},{1,2},{3,4},{3,5},{4,5}}
  10: {{1,2},{1,3},{2,4},{3,5},{4,5}}

Cf. A007716, A049311, A135588, A138178, A283877, A302545, A316983.

Cf. A320797, A320798, A320811, A320812, A321403, A321404, A321405, A321406.

A321410 Number of non-isomorphic self-dual multiset partitions of weight n whose parts are aperiodic multisets whose sizes are relatively prime.

Original entry on oeis.org

1, 1, 1, 2, 4, 9, 15, 35, 69, 149, 301

Offset: 0

Gus Wiseman, Nov 16 2018

A multiset is aperiodic if its multiplicities are relatively prime.
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) and no row or column having a common divisor > 1.
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(6) = 15 multiset partitions:
  {1}  {1}{2}  {2}{12}    {2}{122}      {12}{122}        {2}{12222}
               {1}{2}{3}  {1}{1}{23}    {2}{1222}        {1}{23}{233}
                          {1}{3}{23}    {1}{23}{23}      {1}{3}{2333}
                          {1}{2}{3}{4}  {1}{3}{233}      {2}{13}{233}
                                        {2}{13}{23}      {3}{23}{123}
                                        {3}{3}{123}      {3}{3}{1233}
                                        {1}{2}{2}{34}    {1}{1}{1}{234}
                                        {1}{2}{4}{34}    {1}{2}{34}{34}
                                        {1}{2}{3}{4}{5}  {1}{2}{4}{344}
                                                         {1}{3}{24}{34}
                                                         {1}{4}{4}{234}
                                                         {2}{4}{12}{34}
                                                         {1}{2}{3}{3}{45}
                                                         {1}{2}{3}{5}{45}
                                                         {1}{2}{3}{4}{5}{6}

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

Cf. A320796, A320803, A320806, A320809, A320813, A321283, A321408, A321409, A321411.

A285175 Number of normal generalized Young tableaux, of shape the integer partition with Heinz number n, with all rows and columns strictly increasing.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 3, 5, 1, 5, 1, 7, 11, 1, 1, 11, 1, 13, 23, 9, 1, 7, 11, 11, 11, 25, 1, 51, 1, 1, 39, 13, 45, 23, 1, 15, 59, 25, 1, 135, 1, 41, 73, 17, 1, 9, 45, 73, 83, 61, 1, 45, 107, 63, 111, 19, 1, 135, 1, 21, 259, 1, 205, 279, 1, 85, 143, 349, 1

Offset: 1

Gus Wiseman, Feb 26 2018

nonn

A generalized Young tableau of shape y is an array obtained by replacing the dots in the Ferrers diagram of y with positive integers. A tableau is normal if its entries span an initial interval of positive integers. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The a(15) = 11 tableaux:
1 2 3   1 2 4   1 3 4   1 2 5   1 3 5
4 5     3 5     2 5     3 4     2 4
.
1 2 3   1 2 3   1 2 4   1 2 4   1 3 4
2 4     3 4     2 3     3 4     2 4
.
1 2 3
2 3

Cf. A000085, A001221, A005117, A006958, A015128, A056239, A138178, A153452, A238690, A296150, A296188, A297388, A299925, A299926, A299968, A300118, A300120, A300122.

a[n_]:=If[n===1,1,Sum[a[n/q*Times@@Cases[FactorInteger[q],{p_,k_}:>If[p===2,1,NextPrime[p,-1]^k]]],{q,Select[Rest[Divisors[n]],SquareFreeQ]}]];
Array[a,100]

A321408 Number of non-isomorphic self-dual multiset partitions of weight n whose parts are aperiodic.

Original entry on oeis.org

1, 1, 1, 2, 5, 9, 18, 35, 75, 153, 318

Offset: 0

Gus Wiseman, Nov 16 2018

A multiset is aperiodic if its multiplicities are relatively prime.
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, in which no row or column has a common divisor > 1.
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(6) = 18 multiset partitions:
  {1}  {1}{2}  {2}{12}    {12}{12}      {12}{122}        {112}{122}
               {1}{2}{3}  {2}{122}      {2}{1222}        {12}{1222}
                          {1}{1}{23}    {1}{23}{23}      {2}{12222}
                          {1}{3}{23}    {1}{3}{233}      {12}{13}{23}
                          {1}{2}{3}{4}  {2}{13}{23}      {1}{23}{233}
                                        {3}{3}{123}      {1}{3}{2333}
                                        {1}{2}{2}{34}    {2}{13}{233}
                                        {1}{2}{4}{34}    {3}{23}{123}
                                        {1}{2}{3}{4}{5}  {3}{3}{1233}
                                                         {1}{1}{1}{234}
                                                         {1}{2}{34}{34}
                                                         {1}{2}{4}{344}
                                                         {1}{3}{24}{34}
                                                         {1}{4}{4}{234}
                                                         {2}{4}{12}{34}
                                                         {1}{2}{3}{3}{45}
                                                         {1}{2}{3}{5}{45}
                                                         {1}{2}{3}{4}{5}{6}

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

Cf. A320796, A320797, A320803, A320804, A320805, A320806, A320807, A320809, A320813, A321410, A321411, A321412.

A323451 Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are strictly increasing.

Original entry on oeis.org

1, 1, 1, 3, 3, 6, 9, 12, 19, 27, 39, 54, 79, 107, 150, 209, 282, 387, 525, 707, 949, 1272, 1688, 2244, 2968, 3902, 5125, 6712, 8752, 11383, 14780, 19109, 24671, 31768, 40791, 52280, 66860, 85296, 108621, 138054, 175085, 221676, 280161, 353414, 445098, 559661

Offset: 0

Gus Wiseman, Jan 16 2019

nonn

A generalized Young tableau of shape y is an array obtained by replacing the dots in the Ferrers diagram of y with positive integers.

			The a(8) = 19 generalized Young tableaux:
  8   1 7   2 6   3 5   1 2 5   1 3 4
.
  1   2   3   1 2   1 5   1 3   1 4   2 3   1 2   1 2 3
  7   6   5   5     2     4     3     3     2 3   2
.
  1   1   1 2
  2   3   2
  5   4   3

Seiichi Manyama, Table of n, a(n) for n = 0..50
nLab, Young Diagram.
The Unapologetic Mathematician weblog, Generalized Young Tableaux.

Cf. A000085, A000219, A003293, A114736, A117433, A138178, A299968.

Cf. A323430, A323436, A323437, A323439, A323450.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
sqfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sqfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],SquareFreeQ]}]];
ptnplane[n_]:=Union[Map[primeMS,Join@@Permutations/@sqfacs[n],{2}]];
Table[Sum[Length[Select[ptnplane[Times@@Prime/@y],And@@(LessEqual@@@Transpose[PadRight[#]/.(0->Infinity)])&&And@@(UnsameQ@@@DeleteCases[Transpose[PadRight[#]],0,{2}])&]],{y,IntegerPartitions[n]}],{n,10}]

a(21)-a(45) from Seiichi Manyama, Aug 19 2020

A323580 Number of ways to fill a Young diagram with positive integers summing to n such that the rows are weakly decreasing and the columns are weakly increasing.

Original entry on oeis.org

1, 1, 3, 6, 13, 23, 45, 76, 136, 225, 381, 611, 1001, 1570, 2489, 3842, 5948, 9022, 13714, 20501, 30649, 45262, 66721, 97393, 141888, 204993

Offset: 0

Gus Wiseman, Jan 18 2019

			The a(5) = 23 tableaux:
  5   41   32   311   221   2111   11111
.
  1   2   11   21   11   111   111   1111
  4   3   3    2    21   2     11    1
.
  1   1   11   11   111
  1   2   1    11   1
  3   2   2    1    1
.
  1   11
  1   1
  1   1
  2   1
.
  1
  1
  1
  1
  1

nLab, Young Diagram.

Cf. A000085, A000219, A003293, A114736, A138178, A299968, A323436, A323437, A323438, A323439, A323581.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Sum[Length[Select[Reverse/@Sort/@Map[primeMS,facs[y],{2}],And@@(GreaterEqual@@@Transpose[PadRight[#]])&]],{y,Times@@Prime/@#&/@IntegerPartitions[n]}],{n,10}]

A296560 Number of normal semistandard Young tableaux whose shape is the conjugate of the integer partition with Heinz number n.

Original entry on oeis.org

1, 1, 1, 2, 1, 4, 1, 4, 6, 6, 1, 12, 1, 8, 16, 8, 1, 28, 1, 24, 30, 10, 1, 32, 22, 12, 44, 40, 1, 96, 1, 16, 48, 14, 68, 96, 1, 16, 70, 80, 1, 220, 1, 60, 204, 18, 1, 80, 90, 168, 96, 84, 1, 224, 146, 160, 126, 20, 1, 400, 1, 22, 584, 32, 264, 416, 1, 112, 160

Offset: 1

Gus Wiseman, Feb 15 2018

nonn

A tableau is normal if its entries span an initial interval of positive integers. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Cf. A000085, A001222, A056239, A063834, A112798, A122111, A138178, A153452, A191714, A210391, A228125, A296150, A296188, A299202.

a[n_]:=If[n===1,1,Sum[a[n/q*Times@@Cases[FactorInteger[q],{p_,k_}:>If[p===2,1,NextPrime[p,-1]^k]]],{q,Rest[Divisors[n]]}]];
Array[a,100]

A299967 Number of normal generalized Young tableaux of size n with all rows and columns weakly increasing and all regions non-singleton skew-partitions.

Original entry on oeis.org

1, 0, 2, 3, 13, 32, 121, 376, 1406, 5030, 19632, 76334, 314582, 1308550, 5667494, 24940458, 113239394, 523149560, 2480434938, 11968944532, 59051754824

Offset: 0

Gus Wiseman, Feb 22 2018

A generalized Young tableau of shape y is an array obtained by replacing the dots in the Ferrers diagram of y with positive integers. A tableau is normal if its entries span an initial interval of positive integers.

			The a(4) = 13 tableaux:
1 1 2 2   1 1 1 1
.
1 2 2   1 1 2   1 1 1
1       2       1
.
1 2   1 1   1 1
1 2   2 2   1 1
.
1 2  1 1   1 1
1    2     1
2    2     1
.
1   1
1   1
2   1
2   1

Cf. A000085, A063834, A138178, A153452, A238690, A296188, A297388, A299925, A299926, A299966.

undptns[y_]:=DeleteCases[Select[Tuples[Range[0,#]&/@y],OrderedQ[#,GreaterEqual]&],0,{2}];
ehn[y_]:=ehn[y]=If[Total[y]=!=1,1,0]+Sum[ehn[c],{c,Select[undptns[y],Total[#]>1&&Total[y]-Total[#]>1&]}];
Table[Sum[ehn[y],{y,IntegerPartitions[n]}],{n,15}]

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.

cp's OEIS Frontend

A321403 Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A321404 Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n with no singletons.

Views

Author

Keywords

Comments

Examples

Crossrefs

A321410 Number of non-isomorphic self-dual multiset partitions of weight n whose parts are aperiodic multisets whose sizes are relatively prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

A285175 Number of normal generalized Young tableaux, of shape the integer partition with Heinz number n, with all rows and columns strictly increasing.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A321408 Number of non-isomorphic self-dual multiset partitions of weight n whose parts are aperiodic.

Views

Author

Keywords

Comments

Examples

Crossrefs

A323451 Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are strictly increasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A323580 Number of ways to fill a Young diagram with positive integers summing to n such that the rows are weakly decreasing and the columns are weakly increasing.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A296560 Number of normal semistandard Young tableaux whose shape is the conjugate of the integer partition with Heinz number n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A299967 Number of normal generalized Young tableaux of size n with all rows and columns weakly increasing and all regions non-singleton skew-partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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