A330232 -id:A330232 - cp's OEIS frontend

A330098 Number of distinct multisets of multisets that can be obtained by permuting the vertices of the multiset of multisets with MM-number n.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2

Offset: 1

Gus Wiseman, Dec 09 2019

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

a(n) is a divisor of A303975(n)!.

			The vertex-permutations of {{1,2},{2,3,3}} are:
  {{1,2},{1,3,3}}
  {{1,2},{2,3,3}}
  {{1,3},{1,2,2}}
  {{1,3},{2,2,3}}
  {{2,3},{1,1,2}}
  {{2,3},{1,1,3}}
so a(4927) = 6.

Positions of 1's are A330232.
Positions of first appearances are A330230 and A330233.
The BII-number version is A330231.
Cf. A001055, A003238, A007716, A055621, A056239, A112798, A302242, A303975, A322847, A330194, A330218, A330223, A330227, A330236.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[graprms[primeMS/@primeMS[n]]],{n,100}]

A330227 Number of non-isomorphic fully chiral multiset partitions of weight n.

Original entry on oeis.org

1, 1, 2, 7, 16, 49, 144, 447, 1417, 4707

Offset: 0

Gus Wiseman, Dec 08 2019

A multiset partition is fully chiral if every permutation of the vertices gives a different representative. 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}  {11}    {111}      {1111}
       {1}{1}  {122}      {1222}
               {1}{11}    {1}{111}
               {1}{22}    {11}{11}
               {2}{12}    {1}{122}
               {1}{1}{1}  {1}{222}
               {1}{2}{2}  {12}{22}
                          {1}{233}
                          {2}{122}
                          {1}{1}{11}
                          {1}{1}{22}
                          {1}{2}{22}
                          {1}{3}{23}
                          {2}{2}{12}
                          {1}{1}{1}{1}
                          {1}{2}{2}{2}

MM-numbers of these multiset partitions are the odd terms of A330236.
Non-isomorphic costrict (or T_0) multiset partitions are A316980.
Non-isomorphic achiral multiset partitions are A330223.
BII-numbers of fully chiral set-systems are A330226.
Fully chiral partitions are counted by A330228.
Fully chiral covering set-systems are A330229.
Fully chiral factorizations are A330235.
Cf. A000612, A001055, A007716, A055621, A283877, A317533, A322847, A330098, A330232.

A330223 Number of non-isomorphic achiral multiset partitions of weight n.

Original entry on oeis.org

1, 1, 4, 5, 12, 9, 30, 17, 52, 44, 94, 58, 211, 103, 302, 242, 552, 299, 1024, 492, 1592, 1007, 2523, 1257, 4636, 2000, 6661, 3705, 10823, 4567, 18147, 6844, 26606, 12272, 40766, 15056, 67060, 21639, 95884, 37357, 146781, 44585, 230098, 63263, 330889, 106619, 491182, 124756

Offset: 0

Gus Wiseman, Dec 07 2019

A multiset partition is a finite multiset of finite nonempty multisets. It is achiral if it is not changed by any permutation of the vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(5) = 9 multiset partitions:
  {1}  {11}    {111}      {1111}        {11111}
       {12}    {123}      {1122}        {12345}
       {1}{1}  {1}{11}    {1234}        {1}{1111}
       {1}{2}  {1}{1}{1}  {1}{111}      {11}{111}
               {1}{2}{3}  {11}{11}      {1}{1}{111}
                          {11}{22}      {1}{11}{11}
                          {12}{12}      {1}{1}{1}{11}
                          {1}{1}{11}    {1}{1}{1}{1}{1}
                          {1}{2}{12}    {1}{2}{3}{4}{5}
                          {1}{1}{1}{1}
                          {1}{1}{2}{2}
                          {1}{2}{3}{4}
Non-isomorphic representatives of the a(6) = 30 multiset partitions:
  {111111}  {1}{11111}  {1}{1}{1111}  {1}{1}{1}{111}  {1}{1}{1}{1}{11}
  {111222}  {11}{1111}  {1}{11}{111}  {1}{1}{11}{11}  {1}{1}{2}{2}{12}
  {112233}  {111}{111}  {11}{11}{11}  {1}{2}{11}{22}
  {123456}  {111}{222}  {11}{12}{22}  {1}{2}{12}{12}
            {112}{122}  {11}{22}{33}  {1}{2}{3}{123}    {1}{1}{1}{1}{1}{1}
            {12}{1122}  {1}{2}{1122}                    {1}{1}{1}{2}{2}{2}
            {123}{123}  {12}{12}{12}                    {1}{1}{2}{2}{3}{3}
                        {12}{13}{23}                    {1}{2}{3}{4}{5}{6}

Planted achiral trees are A003238.
Achiral set-systems are counted by A083323.
BII-numbers of achiral set-systems are A330217.
Achiral integer partitions are counted by A330224.
Non-isomorphic fully chiral multiset partitions are A330227.
MM-numbers of achiral multisets of multisets are A330232.
Achiral factorizations are A330234.
Cf. A001055, A007716, A283877, A317533, A330098, A330233.

a(10)-a(11) and a(13) from Erich Friedman, Nov 20 2024
a(12) from Bert Dobbelaere, Apr 29 2025
More terms from Bert Dobbelaere, May 02 2025

A330236 MM-numbers of fully chiral multisets of multisets.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 48, 49, 50, 53, 54, 56, 57, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 78, 80, 81, 82, 83

Offset: 1

Gus Wiseman, Dec 10 2019

nonn

A multiset of multisets is fully chiral every permutation of the vertices gives a different representative.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The sequence of all fully chiral multisets of multisets together with their MM-numbers begins:
   1:             18: {}{1}{1}      37: {112}          57: {1}{111}
   2: {}          19: {111}         38: {}{111}        59: {7}
   3: {1}         20: {}{}{2}       39: {1}{12}        61: {122}
   4: {}{}        21: {1}{11}       40: {}{}{}{2}      62: {}{5}
   5: {2}         22: {}{3}         41: {6}            63: {1}{1}{11}
   6: {}{1}       23: {22}          42: {}{1}{11}      64: {}{}{}{}{}{}
   7: {11}        24: {}{}{}{1}     44: {}{}{3}        65: {2}{12}
   8: {}{}{}      25: {2}{2}        45: {1}{1}{2}      67: {8}
   9: {1}{1}      27: {1}{1}{1}     46: {}{22}         68: {}{}{4}
  10: {}{2}       28: {}{}{11}      48: {}{}{}{}{1}    69: {1}{22}
  11: {3}         31: {5}           49: {11}{11}       70: {}{2}{11}
  12: {}{}{1}     32: {}{}{}{}{}    50: {}{2}{2}       71: {113}
  14: {}{11}      34: {}{4}         53: {1111}         72: {}{}{}{1}{1}
  16: {}{}{}{}    35: {2}{11}       54: {}{1}{1}{1}    74: {}{112}
  17: {4}         36: {}{}{1}{1}    56: {}{}{}{11}     75: {1}{2}{2}
The complement starts: {13, 15, 26, 29, 30, 33, 43, 47, 51, 52, 55, 58, 60, 66, 73, 79, 85, 86, 93, 94}.

Costrict (or T_0) factorizations are A316978.
BII-numbers of fully chiral set-systems are A330226.
Non-isomorphic fully chiral multiset partitions are A330227.
Full chiral partitions are A330228.
Fully chiral covering set-systems are A330229.
Fully chiral factorizations are A330235.
Cf. A001055, A007716, A083323, A112798, A303975, A317533, A330098, A330223, A330224, A330232.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Select[Range[100],Length[graprms[primeMS/@primeMS[#]]]==Length[Union@@primeMS/@primeMS[#]]!&]

Numbers n such that A330098(n) = A303975(n)!.

A330217 BII-numbers of achiral set-systems.

Original entry on oeis.org

0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 16, 25, 32, 42, 52, 63, 64, 75, 116, 127, 128, 129, 130, 131, 136, 137, 138, 139, 256, 385, 512, 642, 772, 903, 1024, 1155, 1796, 1927, 2048, 2184, 2320, 2457, 2592, 2730, 2868, 3007, 4096, 4233, 6416, 6553, 8192, 8330

Offset: 1

Gus Wiseman, Dec 06 2019

nonn

A set-system is a finite set of finite nonempty sets. It is achiral if it is not changed by any permutation of the vertices.

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 set-system 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 achiral set-systems together with their BII-numbers begins:
   1: {{1}}
   2: {{2}}
   3: {{1},{2}}
   4: {{1,2}}
   7: {{1},{2},{1,2}}
   8: {{3}}
   9: {{1},{3}}
  10: {{2},{3}}
  11: {{1},{2},{3}}
  16: {{1,3}}
  25: {{1},{3},{1,3}}
  32: {{2,3}}
  42: {{2},{3},{2,3}}
  52: {{1,2},{1,3},{2,3}}
  63: {{1},{2},{3},{1,2},{1,3},{2,3}}
  64: {{1,2,3}}
  75: {{1},{2},{3},{1,2,3}}

These are numbers n such that A330231(n) = 1.
Achiral set-systems are counted by A083323.
MG-numbers of planted achiral trees are A214577.
Non-isomorphic achiral multiset partitions are A330223.
Achiral integer partitions are counted by A330224.
BII-numbers of fully chiral set-systems are A330226.
MM-numbers of achiral multisets of multisets are A330232.
Achiral factorizations are A330234.
Cf. A000120, A003238, A016031, A048793, A070939, A326031, A326702, A327080, A327081, A330218, A330229, A330233.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Select[Range[0,1000],Length[graprms[bpe/@bpe[#]]]==1&]

A330230 Least MM-number of a multiset of multisets with n distinct representatives obtainable by permuting the vertices.

Original entry on oeis.org

1, 35, 141, 1713, 28011, 355

Offset: 1

Gus Wiseman, Dec 09 2019

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their corresponding multisets of multisets begins:
      1: {}
     35: {{2},{1,1}}
    141: {{1},{2,3}}
   1713: {{1},{2,3,4}}
  28011: {{1},{2,3,4,5}}
    355: {{2},{1,1,3}}

The BII-number version is A330218.
Positions of first appearances in A330098.
The sorted version is A330233.
MM-numbers of achiral multisets of multisets are A330232.
MM-numbers of fully-chiral multisets of multisets are A330236.
Cf. A001055, A003238, A007716, A056239, A112798, A302242, A303975, A322847, A330103, A330223, A330227, A330231, A330236.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Apply[Rule,Table[{p[[i]],i},{i,Length[p]}],{1}])],{p,Permutations[Union@@m]}]];
dv=Table[Length[graprms[primeMS/@primeMS[n]]],{n,1000}];
Table[Position[dv,i][[1,1]],{i,First[Split[Union[dv],#1+1==#2&]]}]

A330226 BII-numbers of fully chiral set-systems.

Original entry on oeis.org

0, 1, 2, 5, 6, 8, 13, 14, 17, 19, 22, 23, 24, 26, 28, 29, 34, 35, 37, 39, 40, 41, 44, 46, 49, 50, 57, 58, 69, 70, 77, 78, 81, 83, 86, 87, 88, 90, 92, 93, 98, 99, 101, 103, 104, 105, 108, 110, 113, 114, 121, 122, 128, 133, 134, 145, 150, 151, 152, 156, 157, 162

Offset: 1

Gus Wiseman, Dec 08 2019

nonn

A set-system is a finite set of finite nonempty sets. It is fully chiral if every permutation of the vertices gives a different representative.

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 set-system 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 fully chiral set-systems together with their BII-numbers begins:
   0: {}
   1: {{1}}
   2: {{2}}
   5: {{1},{1,2}}
   6: {{2},{1,2}}
   8: {{3}}
  13: {{1},{1,2},{3}}
  14: {{2},{1,2},{3}}
  17: {{1},{1,3}}
  19: {{1},{2},{1,3}}
  22: {{2},{1,2},{1,3}}
  23: {{1},{2},{1,2},{1,3}}
  24: {{3},{1,3}}
  26: {{2},{3},{1,3}}
  28: {{3},{1,2},{1,3}}
  29: {{1},{3},{1,2},{1,3}}
  34: {{2},{2,3}}
  35: {{1},{2},{2,3}}
  37: {{1},{1,2},{2,3}}
  39: {{1},{2},{1,2},{2,3}}
For example, 28 is in the sequence because all six permutations give different representatives, namely:
  {{1},{1,2},{2,3}}
  {{1},{1,3},{2,3}}
  {{2},{1,2},{1,3}}
  {{2},{1,3},{2,3}}
  {{3},{1,2},{1,3}}
  {{3},{1,2},{2,3}}

A subset of A326947.
Achiral set-systems are counted by A083323.
BII-numbers of achiral set-systems are A330217.
Non-isomorphic, fully chiral multiset partitions are A330227.
Fully chiral partitions are counted by A330228.
Fully chiral covering set-systems are A330229.
Fully chiral factorizations are A330235.
MM-numbers of fully chiral multisets of multisets are A330236.
Cf. A000120, A000612, A016031, A048793, A070939, A326031, A326702, A330218, A330231, A330232.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Select[Range[0,100],Length[graprms[bpe/@bpe[#]]]==Length[Union@@bpe/@bpe[#]]!&]

A330233 Least MM-numbers of multisets of multisets with a given number of distinct representatives (obtainable by vertex-permutations).

Original entry on oeis.org

1, 35, 141, 1713, 28011, 355, 34567, 4045, 54849, 64615, 15265, 95363, 126841

Offset: 1

Gus Wiseman, Dec 09 2019

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their corresponding multisets of multisets begins:
       1: {}
      35: {{2},{1,1}}
     141: {{1},{2,3}}
     355: {{2},{1,1,3}}
    1713: {{1},{2,3,4}}
    4045: {{2},{1,1,3,4}}
   15265: {{2},{1,4},{1,1,3}}
   28011: {{1},{2,3,4,5}}
   34567: {{1,2},{3,4,5}}
   54849: {{1},{2,3},{4,5}}
   64615: {{2},{1,1,3,4,5}}
   95363: {{2,3},{1,1,4,5}}
  126841: {{3},{1,2},{1,4,5}}

Sorted positions of first appearances in A330098.
The unsorted version is A330230.
The BII-number version is A330218.
MM-numbers of achiral multisets of multisets are A330232.
MM-numbers of fully-chiral multisets of multisets are A330236.
Cf. A001055, A003238, A007716, A056239, A112798, A302242, A303975, A322847, A330103, A330223, A330227, A330231.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Apply[Rule,Table[{p[[i]],i},{i,Length[p]}],{1}])],{p,Permutations[Union@@m]}]];
dv=Table[Length[graprms[primeMS/@primeMS[n]]],{n,1000}];
Table[Position[dv,i][[1,1]],{i,First/@Gather[dv]}]

A330234 Number of achiral factorizations of n into factors > 1.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 0, 1, 2, 2, 5, 1, 0, 1, 0, 2, 2, 1, 0, 2, 2, 3, 0, 1, 2, 1, 7, 2, 2, 2, 5, 1, 2, 2, 0, 1, 2, 1, 0, 0, 2, 1, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 2, 1, 0, 1, 2, 0, 11, 2, 2, 1, 0, 2, 2, 1, 0, 1, 2, 0, 0, 2, 2, 1, 0, 5, 2, 1, 0, 2, 2, 2

Offset: 1

Gus Wiseman, Dec 08 2019

nonn

A multiset of multisets is achiral if it is not changed by any permutation of the vertices. A factorization is achiral if taking the multiset of prime indices of each factor gives an achiral multiset of multisets.

			The a(n) factorizations for n = 2, 6, 27, 36, 243, 216:
  (2)  (6)    (27)     (36)       (243)        (216)
       (2*3)  (3*9)    (4*9)      (3*81)       (6*36)
              (3*3*3)  (6*6)      (9*27)       (8*27)
                       (2*3*6)    (3*9*9)      (12*18)
                       (2*2*3*3)  (3*3*27)     (4*6*9)
                                  (3*3*3*9)    (6*6*6)
                                  (3*3*3*3*3)  (2*3*36)
                                               (2*3*4*9)
                                               (2*3*6*6)
                                               (2*2*3*3*6)
                                               (2*2*2*3*3*3)

The fully chiral version is A330235.
Planted achiral trees are A003238.
Achiral set-systems are counted by A083323.
BII-numbers of achiral set-systems are A330217.
Non-isomorphic achiral multiset partitions are A330223.
Achiral integer partitions are counted by A330224.
MM-numbers of achiral multisets of multisets are A330232.
Cf. A001055, A007716, A112798, A317533, A330098, A330227, A330228, A330236.

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]]}]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[Select[facs[n],Length[graprms[primeMS/@#]]==1&]],{n,100}]

A330235 Number of fully chiral factorizations of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 0, 1, 3, 2, 0, 1, 4, 1, 0, 0, 5, 1, 4, 1, 4, 0, 0, 1, 7, 2, 0, 3, 4, 1, 0, 1, 7, 0, 0, 0, 4, 1, 0, 0, 7, 1, 0, 1, 4, 4, 0, 1, 12, 2, 4, 0, 4, 1, 7, 0, 7, 0, 0, 1, 4, 1, 0, 4, 11, 0, 0, 1, 4, 0, 0, 1, 16, 1, 0, 4, 4, 0, 0, 1, 12, 5, 0, 1, 4, 0, 0

Offset: 1

Gus Wiseman, Dec 08 2019

nonn

A multiset of multisets is fully chiral every permutation of the vertices gives a different representative. A factorization is fully chiral if taking the multiset of prime indices of each factor gives a fully chiral multiset of multisets.

			The a(n) factorizations for n = 1, 4, 8, 12, 16, 24, 48:
  ()  (4)    (8)      (12)     (16)       (24)       (48)
      (2*2)  (2*4)    (2*6)    (2*8)      (3*8)      (6*8)
             (2*2*2)  (3*4)    (4*4)      (4*6)      (2*24)
                      (2*2*3)  (2*2*4)    (2*12)     (3*16)
                               (2*2*2*2)  (2*2*6)    (4*12)
                                          (2*3*4)    (2*3*8)
                                          (2*2*2*3)  (2*4*6)
                                                     (3*4*4)
                                                     (2*2*12)
                                                     (2*2*2*6)
                                                     (2*2*3*4)
                                                     (2*2*2*2*3)

The costrict (or T_0) version is A316978.
The achiral version is A330234.
Planted achiral trees are A003238.
BII-numbers of fully chiral set-systems are A330226.
Non-isomorphic fully chiral multiset partitions are A330227.
Full chiral partitions are A330228.
Fully chiral covering set-systems are A330229.
MM-numbers of fully chiral multisets of multisets are A330236.
Cf. A001055, A007716, A083323, A112798, A317533, A330098, A330223, A330224, A330232.

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]]}]];
graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[Select[facs[n],Length[graprms[primeMS/@#]]==Length[Union@@primeMS/@#]!&]],{n,100}]

cp's OEIS Frontend

A330098 Number of distinct multisets of multisets that can be obtained by permuting the vertices of the multiset of multisets with MM-number n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330227 Number of non-isomorphic fully chiral multiset partitions of weight n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A330223 Number of non-isomorphic achiral multiset partitions of weight n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions

A330236 MM-numbers of fully chiral multisets of multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A330217 BII-numbers of achiral set-systems.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330230 Least MM-number of a multiset of multisets with n distinct representatives obtainable by permuting the vertices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330226 BII-numbers of fully chiral set-systems.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330233 Least MM-numbers of multisets of multisets with a given number of distinct representatives (obtainable by vertex-permutations).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330234 Number of achiral factorizations of n into factors > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica