A304969 -id:A304969 - cp's OEIS frontend

A307058 Expansion of 1/(2 - Product_{k>=1} (1 + x^(2*k-1))).

1, 1, 1, 2, 4, 7, 12, 21, 38, 68, 120, 212, 377, 670, 1188, 2107, 3740, 6638, 11778, 20898, 37084, 65808, 116775, 207212, 367696, 652478, 1157815, 2054524, 3645730, 6469316, 11479734, 20370656, 36147506, 64143372, 113821732, 201975429, 358403220, 635982680, 1128544452, 2002589998

Offset: 0

Ilya Gutkovskiy, Mar 21 2019

nonn

Invert transform of A000700.

Alois P. Heinz, Table of n, a(n) for n = 0..2000

Cf. A000700, A055887, A302017, A304969, A307059.

Row sums of A341279.

m:=80;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( 1/(2 - (&*[1 + x^(2*j-1): j in [1..m+2]])) )); // G. C. Greubel, Jan 24 2024

g:= proc(n) option remember; `if`(n=0, 1, add(add([0, d, -d, d]
      [1+irem(d, 4)], d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
a:= proc(n) option remember; `if`(n=0, 1,
      add(a(n-i)*g(i), i=1..n))
    end:
seq(a(n), n=0..39);  # Alois P. Heinz, Feb 09 2021

nmax = 39; CoefficientList[Series[1/(2 - Product[(1 + x^(2 k - 1)), {k, 1, nmax}]), {x, 0, nmax}], x]

m=80;
def f(x): return 1/(2 - product(1+x^(2*j-1) for j in range(1,m+3)))
def A307058_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f(x) ).list()
A307058_list(m) # G. C. Greubel, Jan 24 2024

a(0) = 1; a(n) = Sum_{k=1..n} A000700(k)*a(n-k).
From G. C. Greubel, Jan 24 2024: (Start)
G.f.: (1+x)/(2*(1+x) - x*QPochhammer(-1/x; x^2)).
G.f.: 1/( 2 - x^(1/24)*etx(x^2)^2/(eta(x^4)*eta(x)) ), where eta(x) is the Dedekind eta function. (End)

A336343 Number of ways to choose a strict partition of each part of a strict composition of n.

Original entry on oeis.org

1, 1, 1, 4, 6, 11, 26, 39, 78, 142, 320, 488, 913, 1558, 2798, 5865, 9482, 16742, 28474, 50814, 82800, 172540, 266093, 472432, 790824, 1361460, 2251665, 3844412, 7205416, 11370048, 19483502, 32416924, 54367066, 88708832, 149179800, 239738369, 445689392

Offset: 0

Gus Wiseman, Jul 19 2020

nonn

A strict composition of n (A032020) is a finite sequence of distinct positive integers summing to n.

Is there a simple generating function?

			The a(1) = 1 through a(5) = 11 ways:
  (1)  (2)  (3)      (4)        (5)
            (2,1)    (3,1)      (3,2)
            (1),(2)  (1),(3)    (4,1)
            (2),(1)  (3),(1)    (1),(4)
                     (1),(2,1)  (2),(3)
                     (2,1),(1)  (3),(2)
                                (4),(1)
                                (1),(3,1)
                                (2,1),(2)
                                (2),(2,1)
                                (3,1),(1)

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

Multiset partitions of partitions are A001970.
Strict compositions are counted by A032020, A072574, and A072575.
Splittings of strict partitions are A072706.
Set partitions of strict partitions are A294617.
Splittings of partitions with distinct sums are A336131.
Cf. A008289, A011782, A304786, A318683, A318684, A319794, A323583, A336128, A336130, A336132, A336133.
Partitions:
- Partitions of each part of a partition are A063834.
- Compositions of each part of a partition are A075900.
- Strict partitions of each part of a partition are A270995.
- Strict compositions of each part of a partition are A336141.
Strict partitions:
- Partitions of each part of a strict partition are A271619.
- Compositions of each part of a strict partition are A304961.
- Strict partitions of each part of a strict partition are A279785.
- Strict compositions of each part of a strict partition are A336142.
Compositions:
- Partitions of each part of a composition are A055887.
- Compositions of each part of a composition are A133494.
- Strict partitions of each part of a composition are A304969.
- Strict compositions of each part of a composition are A307068.
Strict compositions:
- Partitions of each part of a strict composition are A336342.
- Compositions of each part of a strict composition are A336127.
- Strict partitions of each part of a strict composition are A336343.
- Strict compositions of each part of a strict composition are A336139.

strptn[n_]:=Select[IntegerPartitions[n],UnsameQ@@#&];
Table[Length[Join@@Table[Tuples[strptn/@ctn],{ctn,Join@@Permutations/@strptn[n]}]],{n,0,10}]

\\ here Q(N) gives A000009 as a vector.
Q(n) = {Vec(eta(x^2 + O(x*x^n))/eta(x + O(x*x^n)))}
seq(n)={my(b=Q(n)); [subst(serlaplace(p),y,1) | p<-Vec(prod(k=1, n, 1 + y*x^k*b[1+k] + O(x*x^n)))]} \\ Andrew Howroyd, Apr 16 2021

G.f.: Sum_{k>=0} k! * [y^k](Product_{j>=1} 1 + y*x^j*A000009(j)). - Andrew Howroyd, Apr 16 2021

A356934 Number of multisets of odd-size multisets whose multiset union is a size-n multiset covering an initial interval with weakly decreasing multiplicities.

Original entry on oeis.org

1, 1, 2, 6, 17, 46, 166, 553, 2093

Offset: 0

Gus Wiseman, Sep 09 2022

			The a(1) = 1 through a(4) = 17 multiset partitions:
  {{1}}  {{1},{1}}  {{1,1,1}}      {{1},{1,1,1}}
         {{1},{2}}  {{1,1,2}}      {{1},{1,1,2}}
                    {{1,2,3}}      {{1},{1,2,2}}
                    {{1},{1},{1}}  {{1},{1,2,3}}
                    {{1},{1},{2}}  {{1},{2,3,4}}
                    {{1},{2},{3}}  {{2},{1,1,1}}
                                   {{2},{1,1,2}}
                                   {{2},{1,1,3}}
                                   {{2},{1,3,4}}
                                   {{3},{1,1,2}}
                                   {{3},{1,2,4}}
                                   {{4},{1,2,3}}
                                   {{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.
Odd-size multisets are counted by A000302, A027193, A058695, ranked by A026424.
Other conditions: A035310, A063834, A330783, A356938, A356943, A356954.
Other types: A050330, A356932, A356933, A356935.
Cf. A055887, A072233, A270995, A304969, A349050, A349055.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
Table[Length[Select[Join@@mps/@strnorm[n],OddQ[Times@@Length/@#]&]],{n,0,5}]

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}]

A356942 Number of multisets of gapless multisets whose multiset union is a size-n multiset covering an initial interval.

Original entry on oeis.org

1, 1, 4, 15, 61, 249, 1040, 4363, 18424, 78014, 331099, 1407080, 5985505, 25477399, 108493103, 462147381, 1969025286, 8390475609, 35757524184, 152398429323, 649555719160, 2768653475487, 11801369554033, 50304231997727, 214428538858889, 914039405714237

Offset: 0

Gus Wiseman, Sep 08 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.

			The a(1) = 1 through a(3) = 14 multiset partitions:
  {{1}}  {{1,1}}    {{1,1,1}}
         {{1,2}}    {{1,1,2}}
         {{1},{1}}  {{1,2,2}}
         {{1},{2}}  {{1,2,3}}
                    {{1},{1,1}}
                    {{1},{1,2}}
                    {{1},{2,2}}
                    {{1},{2,3}}
                    {{2},{1,1}}
                    {{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. A063834, A072233, A270995, A304969, A349050, A349055, A356934.
Gapless multisets are counted by A034296, ranked by A073491.
Other conditions: A034691, A055887, A116540, A255906, A356933, A356937.
Other types of multiset partitions: A356233, A356941, A356943, A356944.

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]]]];
allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
nogapQ[m_]:=Or[m=={},Union[m]==Range[Min[m],Max[m]]];
Table[Length[Select[Join@@mps/@allnorm[n],And@@nogapQ/@#&]],{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, sum(i=1, min(k, j), (k-i+1)*binomial(j-1, i-1))))}
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(9) and beyond from Andrew Howroyd, Jan 01 2023

A374704 Number of ways to choose an integer partition of each part of an integer composition of n (A055887) such that the minima are identical.

Original entry on oeis.org

1, 1, 3, 6, 15, 31, 77, 171, 410, 957, 2275, 5370, 12795, 30366, 72307, 172071, 409875, 976155, 2325804, 5541230, 13204161, 31464226, 74980838, 178684715, 425830008, 1014816979, 2418489344, 5763712776, 13736075563, 32735874251, 78016456122, 185929792353, 443110675075

Offset: 0

Gus Wiseman, Aug 04 2024

nonn

			The a(0) = 1 through a(4) = 15 ways:
  ()  ((1))  ((2))      ((3))          ((4))
             ((1,1))    ((1,2))        ((1,3))
             ((1),(1))  ((1,1,1))      ((2,2))
                        ((1),(1,1))    ((1,1,2))
                        ((1,1),(1))    ((2),(2))
                        ((1),(1),(1))  ((1,1,1,1))
                                       ((1),(1,2))
                                       ((1,2),(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))

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

A variation for weakly increasing lengths is A141199.
For identical sums instead of minima we have A279787.
The case of reversed twice-partitions is A306319, distinct A358830.
For maxima instead of minima, or for unreversed partitions, we have A358905.
The strict case is A374686 (ranks A374685), maxima A374760 (ranks A374759).
A003242 counts anti-run compositions, ranks A333489.
A011782 counts compositions.
A238130, A238279, A333755 count compositions by number of runs.
A274174 counts contiguous compositions, ranks A374249.
A055887 counts sequences of partitions with total sum n.
A281145 counts same-trees.
A319169 counts partitions with constant Omega, ranked by A320324.
A358911 counts compositions with constant Omega, distinct A358912.
Cf. A000041, A063834, A106356, A189076, A238343, A304969, A305551, A319066, A323429, A333213, A358833, A358835.

Table[Length[Select[Join@@Table[Tuples[IntegerPartitions/@y], {y,Join@@Permutations/@IntegerPartitions[n]}],SameQ@@Min/@#&]],{n,0,15}]

seq(n) = Vec(1 + sum(k=1, n, -1 + 1/(1 - x^k/prod(j=k, n-k, 1 - x^j, 1 + O(x^(n-k+1)))))) \\ Andrew Howroyd, Dec 29 2024

G.f.: 1 + Sum_{k>=1} (-1 + 1/(1 - x^k/Product_{j>=k} (1 - x^j))). - Andrew Howroyd, Dec 29 2024

a(16) onwards from Andrew Howroyd, Dec 29 2024

A307057 Expansion of 1/(2 - Product_{k>=2} 1/(1 - x^k)).

Original entry on oeis.org

1, 0, 1, 1, 3, 4, 10, 15, 33, 55, 111, 195, 380, 684, 1306, 2389, 4507, 8313, 15591, 28881, 53991, 100257, 187086, 347860, 648512, 1206656, 2248399, 4185087, 7796011, 14514195, 27033073, 50334299, 93741325, 174552379, 325067573, 605316388, 1127249250, 2099115548, 3909023438, 7279285948

Offset: 0

Ilya Gutkovskiy, Mar 21 2019

nonn

Invert transform of A002865.

G. C. Greubel, Table of n, a(n) for n = 0..1000

Cf. A002865, A055887, A304969, A307058, A307059, A307060, A307062, A307063.

m:=80;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( 1/(2 - 1/(&*[1 - x^j: j in [2..m+2]])) )); // G. C. Greubel, Jan 24 2024

nmax = 50; CoefficientList[Series[1/(2 - Product[1/(1 - x^k), {k, 2, nmax}]), {x, 0, nmax}], x]
a[0]= 1; a[n_]:= a[n]= Sum[(PartitionsP[k] -PartitionsP[k-1]) a[n-k], {k,n}];
Table[a[n], {n,0,50}]
CoefficientList[Series[1/(2 -(1-x)/QPochhammer[x]), {x,0,80}], x] (* G. C. Greubel, Jan 24 2024 *)

m=80;
def f(x): return 1/( 2 - (1-x)/product(1 - x^j for j in range(1,m+3)) )
def A307057_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f(x) ).list()
A307057_list(m) # G. C. Greubel, Jan 24 2024

a(0) = 1; a(n) = Sum_{k=1..n} A002865(k)*a(n-k).
a(n) ~ c / r^n, where r = 0.53700045638650021831634004949965496126950171484122... is the root of the equation 1 - r = 2*QPochhammer[r] and c = 0.2143395760756683581919851351414497181589685708674442097498294834747517926...
From G. C. Greubel, Jan 24 2024: (Start)
G.f.: 1/( 2 - (1-x)/QPochhammer(x) ).
G.f.: 1/( 2 - x^(1/24)*(1-x)/eta(x) ), where eta(x) is the Dedekind eta function. (End)

A307060 Expansion of 1/(2 - Product_{k>=1} 1/(1 + x^k)).

Original entry on oeis.org

1, -1, 1, -2, 4, -7, 12, -21, 38, -68, 120, -212, 377, -670, 1188, -2107, 3740, -6638, 11778, -20898, 37084, -65808, 116775, -207212, 367696, -652478, 1157815, -2054524, 3645730, -6469316, 11479734, -20370656, 36147506, -64143372, 113821732, -201975429, 358403220, -635982680, 1128544452, -2002589998

Offset: 0

Ilya Gutkovskiy, Mar 21 2019

sign

Invert transform of A081362.

G. C. Greubel, Table of n, a(n) for n = 0..1000

Cf. A081362, A299208, A304969, A307058.

Cf. A307057, A307058, A307059, A307062, A307063.

m:=80;
R:=PowerSeriesRing(Integers(), m);
Coefficients(R!( 1/(2 - (&*[1-x^(2*j-1): j in [1..m+2]])) )); // G. C. Greubel, Jan 24 2024

nmax = 39; CoefficientList[Series[1/(2 - Product[1/(1 + x^k), {k, 1, nmax}]), {x, 0, nmax}], x]

m=80;
def f(x): return 1/( 2 - product(1-x^(2*j-1) for j in range(1,m+3)) )
def A307060_list(prec):
    P. = PowerSeriesRing(QQ, prec)
    return P( f(x) ).list()
A307060_list(m) # G. C. Greubel, Jan 24 2024

G.f.: 1/(2 - Product_{k>=1} (1 - x^(2*k-1))).
a(0) = 1; a(n) = Sum_{k=1..n} A081362(k)*a(n-k).
From G. C. Greubel, Jan 24 2024: (Start)
G.f.: 1/(2 - QPochhammer(x)/QPochhammer(x^2)).
G.f.: 1/(2 - x^(1/24)*eta(x)/eta(x^2)), where eta(x) is the Dedekind eta function. (End)

A336141 Number of ways to choose a strict composition of each part of an integer partition of n.

Original entry on oeis.org

1, 1, 2, 5, 9, 17, 41, 71, 138, 270, 518, 938, 1863, 3323, 6163, 11436, 20883, 37413, 69257, 122784, 221873, 397258, 708142, 1249955, 2236499, 3917628, 6909676, 12130972, 21251742, 36973609, 64788378, 112103360, 194628113, 336713377, 581527210, 1000153063

Offset: 0

Gus Wiseman, Jul 18 2020

nonn

A strict composition of n is a finite sequence of distinct positive integers summing to n.

			The a(1) = 1 through a(5) = 17 ways:
  (1)  (2)      (3)          (4)              (5)
       (1),(1)  (1,2)        (1,3)            (1,4)
                (2,1)        (3,1)            (2,3)
                (2),(1)      (2),(2)          (3,2)
                (1),(1),(1)  (3),(1)          (4,1)
                             (1,2),(1)        (3),(2)
                             (2,1),(1)        (4),(1)
                             (2),(1),(1)      (1,2),(2)
                             (1),(1),(1),(1)  (1,3),(1)
                                              (2,1),(2)
                                              (3,1),(1)
                                              (2),(2),(1)
                                              (3),(1),(1)
                                              (1,2),(1),(1)
                                              (2,1),(1),(1)
                                              (2),(1),(1),(1)
                                              (1),(1),(1),(1),(1)

Alois P. Heinz, Table of n, a(n) for n = 0..5623

Multiset partitions of partitions are A001970.
Strict compositions are counted by A032020, A072574, and A072575.
Splittings of partitions are A323583.
Splittings of partitions with distinct sums are A336131.
Cf. A008289, A011782, A304786, A316245, A318684, A319794, A336128, A336130, A336132, A336135.
Partitions:
- Partitions of each part of a partition are A063834.
- Compositions of each part of a partition are A075900.
- Strict partitions of each part of a partition are A270995.
- Strict compositions of each part of a partition are A336141.
Strict partitions:
- Partitions of each part of a strict partition are A271619.
- Compositions of each part of a strict partition are A304961.
- Strict partitions of each part of a strict partition are A279785.
- Strict compositions of each part of a strict partition are A336142.
Compositions:
- Partitions of each part of a composition are A055887.
- Compositions of each part of a composition are A133494.
- Strict partitions of each part of a composition are A304969.
- Strict compositions of each part of a composition are A307068.
Strict compositions:
- Partitions of each part of a strict composition are A336342.
- Compositions of each part of a strict composition are A336127.
- Strict partitions of each part of a strict composition are A336343.
- Strict compositions of each part of a strict composition are A336139.

b:= proc(n, i, p) option remember; `if`(i*(i+1)/2 g(n$2):
seq(a(n), n=0..38);  # Alois P. Heinz, Jul 31 2020

Table[Length[Join@@Table[Tuples[Join@@Permutations/@Select[IntegerPartitions[#],UnsameQ@@#&]&/@ctn],{ctn,IntegerPartitions[n]}]],{n,0,10}]
(* Second program: *)
b[n_, i_, p_] := b[n, i, p] = If[i(i+1)/2 < n, 0,
     If[n==0, p!, b[n, i-1, p] + b[n-i, Min[n-i, i-1], p+1]]];
g[n_, i_] := g[n, i] = If[n==0 || i==1, 1, g[n, i-1] +
     b[i, i, 0] g[n-i, Min[n-i, i]]];
a[n_] := g[n, n];
a /@ Range[0, 38] (* Jean-François Alcover, May 20 2021, after Alois P. Heinz *)

G.f.: Product_{k >= 1} 1/(1 - A032020(k)*x^k).

cp's OEIS Frontend

A307058 Expansion of 1/(2 - Product_{k>=1} (1 + x^(2*k-1))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

SageMath

Formula

A336343 Number of ways to choose a strict partition of each part of a strict composition of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A356934 Number of multisets of odd-size multisets whose multiset union is a size-n multiset covering an initial interval with weakly decreasing multiplicities.

Views

Author

Keywords

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

A356942 Number of multisets of gapless multisets whose multiset union is a size-n multiset covering an initial interval.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A374704 Number of ways to choose an integer partition of each part of an integer composition of n (A055887) such that the minima are identical.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula