A302478 -id:A302478 - cp's OEIS frontend

A382460 Number of integer partitions of n that can be partitioned into sets with distinct sums in exactly one way.

1, 1, 1, 1, 2, 3, 3, 4, 6, 5, 10, 10, 13, 15, 22, 20, 32, 32, 43, 49, 65, 64, 92, 96, 121, 140, 173, 192

Offset: 0

Gus Wiseman, Mar 29 2025

			The partition y = (3,3,2,1,1,1) has 2 partitions into sets: {{1},{3},{1,2},{1,3}} and {{1},{1,3},{1,2,3}}, but only the latter has distinct sums, so y is counted under a(11)
The a(1) = 1 through a(10) = 10 partitions (A=10):
  1  2  3  4    5    6     7    8      9      A
           211  221  411   322  332    441    433
                311  2211  331  422    522    442
                           511  611    711    622
                                3311   42111  811
                                32111         3322
                                              4411
                                              32221
                                              43111
                                              52111

Twice-partitions of this type are counted by A279785.
Multiset partitions of this type are counted by A381633.
Normal multiset partitions of this type are counted by A381718.
These partitions are ranked by A381870.
For no choices we have A381990, ranks A381806, see A382078, ranks A293243.
For at least one choice we have A381992, ranks A382075, see A382077, ranks A382200.
For distinct blocks instead of block-sums we have A382079, ranks A293511.
MM-numbers of these multiset partitions are A382201, see A302478.
For constant instead of strict blocks we have A382301, ranks A381991.
Set systems: A050320, A050326, A050342, A116539, A296120, A318361.
Set multipartitions: A089259, A116540, A270995, A296119, A318360.
A000041 counts integer partitions, strict A000009.
A265947 counts refinement-ordered pairs of integer partitions.
Cf. A002846, A047966, A213427, A299202, A317142, A358914, A381441, A381454, A381636.

hwt[n_]:=Total[Cases[FactorInteger[n],{p_,k_}:>PrimePi[p]*k]];
ssfacs[n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#,d]&) /@ Select[ssfacs[n/d],Min@@#>d&],{d,Select[Rest[Divisors[n]],SquareFreeQ]}]];
Table[Length[Select[IntegerPartitions[n], Length[Select[ssfacs[Times@@Prime/@#],UnsameQ@@hwt/@#&]]==1&]],{n,0,15}]

A356930 Numbers whose prime indices have all odd prime indices. MM-numbers of finite multisets of finite multisets of odd numbers.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18, 19, 21, 22, 24, 27, 28, 29, 31, 32, 33, 36, 38, 42, 44, 48, 49, 53, 54, 56, 57, 58, 59, 62, 63, 64, 66, 71, 72, 76, 77, 79, 81, 83, 84, 87, 88, 93, 96, 97, 98, 99, 106, 108, 112, 114, 116, 118, 121, 124, 126, 127

Offset: 1

Gus Wiseman, Sep 11 2022

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. We define the multiset of multisets with MM-number n to be formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. The combined size of this multiset of multisets is A302242(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 initial terms and corresponding multisets of multisets:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   6: {{},{1}}
   7: {{1,1}}
   8: {{},{},{}}
   9: {{1},{1}}
  11: {{3}}
  12: {{},{},{1}}
  14: {{},{1,1}}
  16: {{},{},{},{}}
  18: {{},{1},{1}}
  19: {{1,1,1}}
  21: {{1},{1,1}}
  22: {{},{3}}
  24: {{},{},{},{1}}
  27: {{1},{1},{1}}
  28: {{},{},{1,1}}
  29: {{1,3}}
  31: {{5}}
  32: {{},{},{},{},{}}

Gus Wiseman, Counting and ranking classes of multiset partitions related to gapless multisets

Multisets of odd numbers are counted by A000009, ranked by A066208.
Factorizations of this type are counted by A356931.
The version for odd lengths instead of parts is A356935, ranked by A089259.
Other conditions: A302478, A302492, A356939, A356940, A356944, A356955.
A000041 counts integer partitions, strict A000009.
A000688 counts factorizations into prime powers.
A001055 counts factorizations.
A001221 counts prime divisors, sum A001414.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
Cf. A000720, A003963, A011782, A055887, A076610, A302242, A304969.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],And@@(OddQ[Times@@primeMS[#]]&/@primeMS[#])&]

A356940 MM-numbers of multisets of initial intervals. Products of elements of A062447 (primes indexed by primorials A002110).

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 27, 32, 36, 39, 48, 52, 54, 64, 72, 78, 81, 96, 104, 108, 113, 117, 128, 144, 156, 162, 169, 192, 208, 216, 226, 234, 243, 256, 288, 312, 324, 338, 339, 351, 384, 416, 432, 452, 468, 486, 507, 512, 576, 624, 648

Offset: 1

Gus Wiseman, Sep 12 2022

nonn

An initial interval is a set {1,2,...,n}  for some n >= 0.
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.
We define the multiset of multisets with MM-number n to be formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. The size of this multiset of multisets is A302242(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 initial terms and corresponding multisets of multisets:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   6: {{},{1}}
   8: {{},{},{}}
   9: {{1},{1}}
  12: {{},{},{1}}
  13: {{1,2}}
  16: {{},{},{},{}}
  18: {{},{1},{1}}
  24: {{},{},{},{1}}
  26: {{},{1,2}}
  27: {{1},{1},{1}}
  32: {{},{},{},{},{}}
  36: {{},{},{1},{1}}
  39: {{1},{1,2}}
  48: {{},{},{},{},{1}}
  52: {{},{},{1,2}}
  54: {{},{1},{1},{1}}
  64: {{},{},{},{},{},{}}

Gus Wiseman, Counting and ranking classes of multiset partitions related to gapless multisets

This is the initial version of A356939.
Initial intervals are counted by A010054, ranked by A002110.
Other types: A007294, A322585.
Other conditions: A302478, A302492, A356930, A356935, A356944, A356955.
A000041 counts integer partitions, strict A000009.
A000688 counts factorizations into prime powers.
A001055 counts factorizations.
A001221 counts prime divisors, sum A001414.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
Cf. A000040, A000720, A003963, A055887, A076610, A302242, A304969.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
chinQ[y_]:=y==Range[Length[y]];
Select[Range[100],And@@chinQ/@primeMS/@primeMS[#]&]

A356955 MM-numbers of multisets of multisets, each covering an initial interval. Products of primes indexed by elements of A055932.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 16, 18, 19, 21, 24, 26, 27, 28, 32, 36, 37, 38, 39, 42, 48, 49, 52, 53, 54, 56, 57, 61, 63, 64, 72, 74, 76, 78, 81, 84, 89, 91, 96, 98, 104, 106, 108, 111, 112, 113, 114, 117, 122, 126, 128, 131, 133, 144, 147, 148, 151, 152

Offset: 1

Gus Wiseman, Sep 12 2022

nonn

An initial interval is a set {1,2,...,n}  for some n >= 0.
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.
We define the multiset of multisets with MM-number n to be formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. The size of this multiset of multisets is A302242(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 initial terms and corresponding multisets of multisets:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   6: {{},{1}}
   7: {{1,1}}
   8: {{},{},{}}
   9: {{1},{1}}
  12: {{},{},{1}}
  13: {{1,2}}
  14: {{},{1,1}}
  16: {{},{},{},{}}
  18: {{},{1},{1}}
  19: {{1,1,1}}
  21: {{1},{1,1}}
  24: {{},{},{},{1}}
  26: {{},{1,2}}
  27: {{1},{1},{1}}
  28: {{},{},{1,1}}
  32: {{},{},{},{},{}}

Gus Wiseman, Counting and ranking classes of multiset partitions related to gapless multisets

Multisets covering an initial interval are ctd by A011782, rkd by A055932.
This is the initial version of A356944.
Other types: A034691, A089259, A356945, A356954.
Other conditions: A302478, A302492, A356930, A356935, A356939, A356940.
A000041 counts integer partitions, strict A000009.
A000670 counts patterns, ranked by A333217, necklace A019536.
A000688 counts factorizations into prime powers.
A001055 counts factorizations.
A001221 counts prime divisors, sum A001414.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
Cf. A000040, A000720, A003963, A055887, A076610, A270995, A302242, A304969, A349050, A349055.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Select[Range[100],And@@normQ/@primeMS/@primeMS[#]&]

A320463 MM-numbers of labeled simple hypergraphs with no singletons spanning an initial interval of positive integers.

Original entry on oeis.org

1, 13, 113, 377, 611, 1291, 1363, 1469, 1937, 2021, 2117, 3277, 4537, 4859, 5249, 5311, 7423, 8249, 8507, 16211, 16403, 16559, 16783, 16837, 17719, 20443, 20453, 24553, 25477, 26273, 26969, 27521, 34567, 37439, 39437, 41689, 42011, 42137, 42601, 43873, 43957

Offset: 1

Gus Wiseman, Oct 13 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their multiset multisystems begins:
      1: {}
     13: {{1,2}}
    113: {{1,2,3}}
    377: {{1,2},{1,3}}
    611: {{1,2},{2,3}}
   1291: {{1,2,3,4}}
   1363: {{1,3},{2,3}}
   1469: {{1,2},{1,2,3}}
   1937: {{1,2},{3,4}}
   2021: {{1,4},{2,3}}
   2117: {{1,3},{2,4}}
   3277: {{1,3},{1,2,3}}
   4537: {{1,2},{1,3,4}}
   4859: {{1,4},{1,2,3}}
   5249: {{1,3},{1,2,4}}
   5311: {{2,3},{1,2,3}}
   7423: {{1,2},{2,3,4}}
   8249: {{2,4},{1,2,3}}
   8507: {{2,3},{1,2,4}}
  16211: {{1,2},{1,3},{1,4}}

Wikipedia, Hypergraph

Cf. A003963, A005117, A055932, A056239, A112798, A255906, A290103, A302242, A302478, A305052.

Cf. A320456, A320458, A320464, A320532, A320533.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
Select[Range[10000],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],And@@(And[SquareFreeQ[#],PrimeOmega[#]>1]&/@primeMS[#])]&]

A320464 MM-numbers of labeled multi-hypergraphs with no singletons spanning an initial interval of positive integers.

Original entry on oeis.org

1, 13, 113, 169, 377, 611, 1291, 1363, 1469, 1937, 2021, 2117, 2197, 3277, 4537, 4859, 4901, 5249, 5311, 7423, 7943, 8249, 8507, 10933, 12769, 16211, 16403, 16559, 16783, 16837, 17719, 19097, 20443, 20453, 24553, 25181, 25477, 26273, 26969, 27521, 28561, 28717

Offset: 1

Gus Wiseman, Oct 13 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

			The sequence of terms together with their multiset multisystems begins:
     1: {}
    13: {{1,2}}
   113: {{1,2,3}}
   169: {{1,2},{1,2}}
   377: {{1,2},{1,3}}
   611: {{1,2},{2,3}}
  1291: {{1,2,3,4}}
  1363: {{1,3},{2,3}}
  1469: {{1,2},{1,2,3}}
  1937: {{1,2},{3,4}}
  2021: {{1,4},{2,3}}
  2117: {{1,3},{2,4}}
  2197: {{1,2},{1,2},{1,2}}
  3277: {{1,3},{1,2,3}}
  4537: {{1,2},{1,3,4}}
  4859: {{1,4},{1,2,3}}
  4901: {{1,2},{1,2},{1,3}}
  5249: {{1,3},{1,2,4}}
  5311: {{2,3},{1,2,3}}
  7423: {{1,2},{2,3,4}}
  7943: {{1,2},{1,2},{2,3}}
  8249: {{2,4},{1,2,3}}
  8507: {{2,3},{1,2,4}}

Wikipedia, Hypergraph

Cf. A003963, A055932, A056239, A112798, A255906, A290103, A302242, A302478, A305052.

Cf. A320456, A320459, A320463, A320532, A320533.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
Select[Range[10000],And[normQ[primeMS/@primeMS[#]],And@@(And[SquareFreeQ[#],PrimeOmega[#]>1]&/@primeMS[#])]&]

A320631 Products of odd primes of nonprime squarefree index.

Original entry on oeis.org

13, 29, 43, 47, 73, 79, 101, 113, 137, 139, 149, 163, 167, 169, 181, 199, 233, 257, 269, 271, 293, 313, 317, 347, 349, 373, 377, 389, 397, 421, 439, 443, 449, 467, 487, 491, 499, 557, 559, 571, 577, 601, 607, 611, 619, 631, 647, 653, 673, 677, 727, 733, 751

Offset: 1

Gus Wiseman, Oct 18 2018

nonn

			The sequence of terms begins:
   13 = prime(6)
   29 = prime(10)
   43 = prime(14)
   47 = prime(15)
   73 = prime(21)
   79 = prime(22)
  101 = prime(26)
  113 = prime(30)
  137 = prime(33)
  139 = prime(34)
  149 = prime(35)
  163 = prime(38)
  167 = prime(39)
  169 = prime(6)^2
  181 = prime(42)
  199 = prime(46)
  233 = prime(51)
  257 = prime(55)
  269 = prime(57)
  271 = prime(58)
  293 = prime(62)
  313 = prime(65)
  317 = prime(66)
  347 = prime(69)
  349 = prime(70)
  373 = prime(74)
  377 = prime(6)*prime(10)

Cf. A000040, A006450, A007821, A018252, A056239, A076610, A112798, A302242, A302478, A320628, A320629, A320630, A320633.

Select[Range[1,100,2],With[{f=PrimePi/@First/@FactorInteger[#]},And[And@@SquareFreeQ/@f,And@@Not/@PrimeQ/@f]]&]

A371289 Numbers whose binary indices have squarefree product.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 32, 33, 48, 49, 64, 65, 66, 67, 68, 69, 70, 71, 80, 81, 82, 83, 84, 85, 86, 87, 96, 97, 112, 113, 512, 513, 516, 517, 576, 577, 580, 581, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1040, 1041, 1042

Offset: 1

Gus Wiseman, Mar 25 2024

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 terms together with their binary expansions and binary indices begin:
     0:              0 ~ {}
     1:              1 ~ {1}
     2:             10 ~ {2}
     3:             11 ~ {1,2}
     4:            100 ~ {3}
     5:            101 ~ {1,3}
     6:            110 ~ {2,3}
     7:            111 ~ {1,2,3}
    16:          10000 ~ {5}
    17:          10001 ~ {1,5}
    18:          10010 ~ {2,5}
    19:          10011 ~ {1,2,5}
    20:          10100 ~ {3,5}
    21:          10101 ~ {1,3,5}
    22:          10110 ~ {2,3,5}
    23:          10111 ~ {1,2,3,5}
    32:         100000 ~ {6}
    33:         100001 ~ {1,6}
    48:         110000 ~ {5,6}
    49:         110001 ~ {1,5,6}
    64:        1000000 ~ {7}
    65:        1000001 ~ {1,7}
    66:        1000010 ~ {2,7}

For prime instead of binary indices we have A302505.
For squarefree parts we have A368533, for prime indices A302478.
A005117 lists squarefree numbers.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
Cf. A325118, A326782, A371290, A371291, A371292, A371293, A371443, A371446, A371448, A371449, A371452, A371453.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],SquareFreeQ[Times@@bpe[#]]&]

A382458 Number of normal multisets of size n that can be partitioned into a set of sets in exactly one way.

Original entry on oeis.org

1, 1, 0, 2, 1, 3, 0, 7, 3, 11, 18, 9

Offset: 0

Gus Wiseman, Mar 30 2025

We call a multiset or multiset partition normal iff it covers an initial interval of positive integers. The size of a multiset is the number of elements, counting multiplicity.

			The normal multiset {1,2,2,2,2,3,3,4} has three multiset partitions into a set of sets:
  {{2},{1,2},{2,3},{2,3,4}}
  {{2},{2,3},{2,4},{1,2,3}}
  {{2},{3},{1,2},{2,3},{2,4}}
so is not counted under a(8).
The a(1) = 1 through a(7) = 7 normal multisets:
  {1}  .  {1,1,2}  {1,1,2,2}  {1,1,1,2,3}  .  {1,1,1,1,2,3,4}
          {1,2,2}             {1,2,2,2,3}     {1,1,1,2,2,2,3}
                              {1,2,3,3,3}     {1,1,1,2,3,3,3}
                                              {1,2,2,2,2,3,4}
                                              {1,2,2,2,3,3,3}
                                              {1,2,3,3,3,3,4}
                                              {1,2,3,4,4,4,4}

For constant instead of strict blocks we have A000045.
Factorizations of this type are counted by A050326, with distinct sums A381633.
For the strong case see A292444, A382430, complement A381996, A382523.
MM-numbers of sets of sets are A302494, see A302478, A382201.
Twice-partitions into distinct sets are counted by A358914, with distinct sums A279785.
For integer partitions we have A382079 (A293511), with distinct sums A382460, (A381870).
With distinct sums we have A382459.
Set multipartitions: A050320, A089259, A116540, A270995, A296119, A318360.
Normal multiset partitions: A034691, A035310, A116539, A255906, A381718.
Set systems: A050342, A296120, A318361.
Partitions: A382077 (A382200), A381992 (A382075), A382078 (A293243), A381990 (A381806).
Cf. A000110, A000670, A007716, A255903, A275780, A292432, A317532, A326519, A382428.

allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]] /@ Subsets[Range[n-1]+1]];
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,_}];
mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]& /@ sps[Range[Length[mset]]]];
Table[Length[Select[allnorm[n], Length[Select[mps[#], UnsameQ@@#&&And@@UnsameQ@@@#&]]==1&]], {n,0,5}]

A382459 Number of normal multisets of size n that can be partitioned into a set of sets with distinct sums in exactly one way.

Original entry on oeis.org

1, 1, 0, 2, 1, 3, 2, 7, 4, 10, 19

Offset: 0

Gus Wiseman, Apr 01 2025

We call a multiset or multiset partition normal iff it covers an initial interval of positive integers. The size of a multiset is the number of elements, counting multiplicity.

			The normal multiset {1,2,2,2,2,3,3,4} has only one multiset partition into a set of sets with distinct sums: {{2},{1,2},{2,3},{2,3,4}}, so is counted under a(8).
The a(1) = 1 through a(7) = 7 multisets:
  {1}  .  {112}  {1122}  {11123}  {111233}  {1111234}
          {122}          {12223}  {122233}  {1112223}
                         {12333}            {1112333}
                                            {1222234}
                                            {1222333}
                                            {1233334}
                                            {1234444}

Twice-partitions of this type are counted by A279785, A270995, A358914.
Factorizations of this type are counted by A381633, A050320, A050326.
Normal multiset partitions of this type are A381718, A116540, A116539.
Multiset partitions of this type are ranked by A382201, A302478, A302494.
For at least one choice: A382216 (strict A382214), complement A382202 (strict A292432).
For the strong case see: A382430 (strict A292444), complement A382523 (strict A381996).
Without distinct sums we have A382458.
For integer partitions we have A382460, ranks A381870, strict A382079, ranks A293511.
Set multipartitions: A089259, A296119, A318360.
Normal multiset partitions: A034691, A035310, A255906.
Set systems: A050342, A296120, A318361.
Partitions: A382077 (A382200), A381992 (A382075), A382078 (A293243), A381990 (A381806).
Cf. A000110, A000670, A007716, A255903, A275780, A317532, A321469, A326519, A381078, A381441, A382428.

allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]&/@sps[Range[Length[mset]]]];
Table[Length[Select[allnorm[n],Length[Select[mps[#],UnsameQ@@Total/@#&&And@@UnsameQ@@@#&]]==1&]],{n,0,5}]

cp's OEIS Frontend

A382460 Number of integer partitions of n that can be partitioned into sets with distinct sums in exactly one way.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A356930 Numbers whose prime indices have all odd prime indices. MM-numbers of finite multisets of finite multisets of odd numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A356940 MM-numbers of multisets of initial intervals. Products of elements of A062447 (primes indexed by primorials A002110).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A356955 MM-numbers of multisets of multisets, each covering an initial interval. Products of primes indexed by elements of A055932.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A320463 MM-numbers of labeled simple hypergraphs with no singletons spanning an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A320464 MM-numbers of labeled multi-hypergraphs with no singletons spanning an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A320631 Products of odd primes of nonprime squarefree index.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A371289 Numbers whose binary indices have squarefree product.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A382458 Number of normal multisets of size n that can be partitioned into a set of sets in exactly one way.

Views

Author

Keywords