A356939 -id:A356939 - cp's OEIS frontend

A356935 Numbers whose prime indices all have odd bigomega (number of prime factors with multiplicity). Products of primes indexed by elements of A026424. MM-numbers of finite multisets of finite odd-length multisets of positive integers.

1, 3, 5, 9, 11, 15, 17, 19, 25, 27, 31, 33, 37, 41, 45, 51, 55, 57, 59, 61, 67, 71, 75, 81, 83, 85, 93, 95, 99, 103, 107, 109, 111, 113, 121, 123, 125, 127, 131, 135, 153, 155, 157, 165, 171, 177, 179, 181, 183, 185, 187, 191, 193, 197, 201, 205, 209, 211, 213

Offset: 1

Gus Wiseman, Sep 12 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 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 multiset partitions:
   1: {}
   3: {{1}}
   5: {{2}}
   9: {{1},{1}}
  11: {{3}}
  15: {{1},{2}}
  17: {{4}}
  19: {{1,1,1}}
  25: {{2},{2}}
  27: {{1},{1},{1}}
  31: {{5}}
  33: {{1},{3}}
  37: {{1,1,2}}
  41: {{6}}
  45: {{1},{1},{2}}
  51: {{1},{4}}
  55: {{2},{3}}
  57: {{1},{1,1,1}}

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

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.
Odd-size multisets are ctd by A000302, A027193, A058695, rkd by A026424.
Other types: A050330, A356932, A356933, A356934.
Other conditions: A302478, A302492, A356930, A356939, A356940, A356944, A356945.
Cf. A000040, A000720, A003963, A270995, A302242, A304969, A349050, A349055.

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

A356944 MM-numbers of multisets of gapless multisets of positive integers. Products of primes indexed by elements of A073491.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70

Offset: 1

Gus Wiseman, Sep 12 2022

nonn

A multiset is gapless if it covers an interval of positive integers. For example, {2,3,3,4} is gapless but {1,1,3,3} is not.
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 multiset partitions:
   1: {}
   2: {{}}
   3: {{1}}
   4: {{},{}}
   5: {{2}}
   6: {{},{1}}
   7: {{1,1}}
   8: {{},{},{}}
   9: {{1},{1}}
  10: {{},{2}}
  11: {{3}}
  12: {{},{},{1}}
  13: {{1,2}}
  14: {{},{1,1}}
  15: {{1},{2}}
  16: {{},{},{},{}}

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

Gapless multisets are counted by A034296, ranked by A073491.
The initial version is A356955.
Other types: A356233, A356941, A356942, A356943.
Other conditions: A302478, A302492, A356930, A356935, A356939, A356940.
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.
A011782 counts multisets covering an initial interval.
A056239 adds up prime indices, row sums of A112798.
Cf. A000720, A003963, A076610, A270995, A302242, A349050, A349055.

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

A356937 Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers.

Original entry on oeis.org

1, 1, 3, 9, 29, 94, 310, 1026, 3411, 11360, 37886, 126442, 422203, 1410189, 4711039, 15740098, 52593430, 175742438, 587266782, 1962469721, 6558071499, 21915580437, 73237274083, 244744474601, 817889464220, 2733235019732, 9133973730633, 30524096110942, 102006076541264

Offset: 0

Gus Wiseman, Sep 08 2022

nonn

An interval such as {3,4,5} is a set with all differences of adjacent elements equal to 1.

			The a(1) = 1 through a(3) = 9 set multipartitions (multisets of sets):
  {{1}}  {{1,2}}    {{1,2,3}}
         {{1},{1}}  {{1},{1,2}}
         {{1},{2}}  {{1},{2,3}}
                    {{2},{1,2}}
                    {{3},{1,2}}
                    {{1},{1},{1}}
                    {{1},{1},{2}}
                    {{1},{2},{2}}
                    {{1},{2},{3}}

Andrew Howroyd, Table of n, a(n) for n = 0..200
Gus Wiseman, Counting and ranking classes of multiset partitions related to gapless multisets

A000041 counts integer partitions, strict A000009.
A000670 counts patterns, ranked by A333217, necklace A019536.
A011782 counts multisets covering an initial interval.
Cf. A055887, A063834, A270995, A304969, A349050, A349055.
Intervals are counted by A000012, A001227, ranked by A073485.
Other conditions: A034691, A116540, A255906, A356933, A356942.
Other types: A107742, A356936, A356938, A356939.

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[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
chQ[y_]:=Or[Length[y]<=1,Union[Differences[y]]=={1}];
Table[Length[Select[Join@@mps/@allnorm[n],And@@chQ/@#&]],{n,0,5}]

EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
R(n,k) = {EulerT(vector(n, j, max(0, 1+k-j)))}
seq(n) = {my(A=1+O(y*y^n)); for(k = 1, n, A += x^k*(1 + y*Ser(R(n,k), y) - polcoef(1/(1 - x*A) + O(x^(k+2)), k+1))); Vec(subst(A,x,1))} \\ Andrew Howroyd, Jan 01 2023

Terms a(10) and beyond from Andrew Howroyd, Jan 01 2023

A356938 Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers with weakly decreasing multiplicities.

Original entry on oeis.org

1, 1, 3, 7, 18, 41, 101, 228, 538, 1209

Offset: 0

Gus Wiseman, Sep 09 2022

An interval such as {3,4,5} is a set of positive integers with all differences of adjacent elements equal to 1.

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

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

A000041 counts integer partitions, strict A000009.
A000670 counts patterns, ranked by A333217, necklace A019536.
A011782 counts multisets covering an initial interval.
Intervals are counted by A000012, A001227, ranked by A073485.
Other conditions: A035310, A063834, A330783, A356934.
Other types: A107742, A356936, A356937, A356939, A356943, A356954.
Cf. A055887, A072233, A270995, A304969, A349050, A349055.

strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
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]]]];
chQ[y_]:=Or[Length[y]<=1,Union[Differences[y]]=={1}];
Table[Length[Select[Join@@mps/@strnorm[n],And@@chQ/@#&]],{n,0,5}]

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[#])&]

A356936 Number of multiset partitions of the multiset of prime indices of n into intervals. Number of factorizations of n into members of A073485.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1

Offset: 1

Gus Wiseman, Sep 08 2022

nonn

An interval is a set of positive integers with all differences of adjacent elements equal to 1.

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 a(n) multiset partitions for n = 6, 30, 36, 90, 180:
  {12}    {123}      {12}{12}      {12}{23}      {12}{123}
  {1}{2}  {1}{23}    {1}{2}{12}    {2}{123}      {1}{12}{23}
          {3}{12}    {1}{1}{2}{2}  {1}{2}{23}    {1}{2}{123}
          {1}{2}{3}                {2}{3}{12}    {3}{12}{12}
                                   {1}{2}{2}{3}  {1}{1}{2}{23}
                                                 {1}{2}{3}{12}
                                                 {1}{1}{2}{2}{3}
The a(n) factorizations for n = 6, 30, 36, 90, 180:
  (6)    (30)     (6*6)      (3*30)     (6*30)
  (2*3)  (5*6)    (2*3*6)    (6*15)     (5*6*6)
         (2*15)   (2*2*3*3)  (3*5*6)    (2*3*30)
         (2*3*5)             (2*3*15)   (2*6*15)
                             (2*3*3*5)  (2*3*5*6)
                                        (2*2*3*15)
                                        (2*2*3*3*5)

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

A000688 counts factorizations into prime powers.
A001055 counts factorizations.
A001221 counts prime divisors, sum A001414.
A001222 counts prime factors with multiplicity.
A356069 counts gapless divisors, initial A356224 (complement A356225).
A056239 adds up prime indices, row sums of A112798.
Intervals are counted by A000012, A001227, ranked by A073485.
Other types: A107742, A356233, A356937, A356938, A356939.
Other conditions: A050320, A050330, A322585, A356931, A356945.
Cf. A003963, A073491, A287170, A328195, A356234.

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]]}]];
chQ[y_]:=Or[Length[y]<=1,Union[Differences[y]]=={1}];
Table[Length[Select[facs[n],And@@chQ/@primeMS/@#&]],{n,100}]

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[#]&]

A356957 Number of set partitions of strict integer partitions of n into intervals, where an interval is a set of positive integers with all differences of adjacent elements equal to 1.

Original entry on oeis.org

1, 1, 1, 3, 2, 4, 7, 7, 8, 13, 20, 19, 27, 30, 42, 60, 63, 75, 99, 112, 141, 191, 205, 248, 296, 357, 408, 513, 617, 696, 831, 969, 1117, 1337, 1523, 1797, 2171, 2420, 2805, 3265, 3772, 4289, 5013, 5661, 6579, 7679, 8615, 9807, 11335, 12799, 14581

Offset: 0

Gus Wiseman, Sep 13 2022

nonn

			The a(1) = 1 through a(6) = 7 set partitions:
  {{1}}  {{2}}  {{3}}      {{4}}      {{5}}      {{6}}
                {{1,2}}    {{1},{3}}  {{2,3}}    {{1,2,3}}
                {{1},{2}}             {{1},{4}}  {{1},{5}}
                                      {{2},{3}}  {{2},{4}}
                                                 {{1},{2,3}}
                                                 {{1,2},{3}}
                                                 {{1},{2},{3}}

Intervals are counted by A000012, A001227, ranked by A073485.
The initial version is A010054.
For set partitions of {1..n} we have A011782.
The non-strict version is A107742
Not restricting to intervals gives A294617.
More types: A356936, A356937, A356938, A356939, A356940.
A000041 counts integer partitions, strict A000009.
A000110 counts set partitions.
A001970 counts multiset partitions of integer partitions.
A356941 counts multiset partitions of integer partitions w/ gapless blocks.
Cf. A001055, A055887, A061260, A270995, A304969, A349050, A349055.

chQ[y_] := Length[y] <= 1 || Union[Differences[y]] == {1};
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[Join@@sps/@Reverse/@Select[IntegerPartitions[n], UnsameQ@@#&],And@@chQ/@#&]],{n,0,15}]

cp's OEIS Frontend

A356935 Numbers whose prime indices all have odd bigomega (number of prime factors with multiplicity). Products of primes indexed by elements of A026424. MM-numbers of finite multisets of finite odd-length multisets of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A356944 MM-numbers of multisets of gapless multisets of positive integers. Products of primes indexed by elements of A073491.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A356937 Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A356938 Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers with weakly decreasing multiplicities.

Views

Author

Keywords

Comments

Examples

Links

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

A356936 Number of multiset partitions of the multiset of prime indices of n into intervals. Number of factorizations of n into members of A073485.

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