A330675 -id:A330675 - cp's OEIS frontend

A035310 Let f(n) = number of ways to factor n = A001055(n); a(n) = sum of f(k) over all terms k in A025487 that have n factors.

1, 4, 12, 47, 170, 750, 3255, 16010, 81199, 448156, 2579626, 15913058, 102488024, 698976419, 4976098729, 37195337408, 289517846210, 2352125666883, 19841666995265, 173888579505200, 1577888354510786, 14820132616197925, 143746389756336173, 1438846957477988926

Offset: 1

Alford Arnold

Ways of partitioning an n-multiset with multiplicities some partition of n.

Number of multiset partitions of strongly normal multisets of size n, where a finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities. The (weakly) normal version is A255906. - Gus Wiseman, Dec 31 2019

			a(3) = 12 because there are 3 terms in A025487 with 3 factors, namely 8, 12, 30; and f(8)=3, f(12)=4, f(30)=5 and 3+4+5 = 12.
From _Gus Wiseman_, Dec 31 2019: (Start)
The a(1) = 1 through a(3) = 12 multiset partitions of strongly normal multisets:
  {{1}}  {{1,1}}    {{1,1,1}}
         {{1,2}}    {{1,1,2}}
         {{1},{1}}  {{1,2,3}}
         {{1},{2}}  {{1},{1,1}}
                    {{1},{1,2}}
                    {{1},{2,3}}
                    {{2},{1,1}}
                    {{2},{1,3}}
                    {{3},{1,2}}
                    {{1},{1},{1}}
                    {{1},{1},{2}}
                    {{1},{2},{3}}
(End)

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

Cf. A025487, A000041, A000110, A035098, A080688.
Sequence A035341 counts the ordered cases. Tables A093936 and A095705 distribute the values; e.g. 81199 = 30 + 536 + 3036 + 6181 + 10726 + 11913 + 14548 + 13082 + 21147.
Cf. A035341, A093936, A095705.
Row sums of A317449.
The uniform case is A317584.
The case with empty intersection is A317755.
The strict case is A317775.
The constant case is A047968.
The set-system case is A318402.
The case of strict parts is A330783.
Multiset partitions of integer partitions are A001970.
Unlabeled multiset partitions are A007716.
Cf. A001055, A255906, A269134, A316652, A317654, A318284, A330467, A330471, A330475, A330675.

with(numtheory):
g:= proc(n, k) option remember;
      `if`(n>k, 0, 1) +`if`(isprime(n), 0,
      add(`if`(d>k, 0, g(n/d, d)), d=divisors(n) minus {1, n}))
    end:
b:= proc(n, i, l)
      `if`(n=0, g(mul(ithprime(t)^l[t], t=1..nops(l))$2),
      `if`(i<1, 0, add(b(n-i*j, i-1, [l[], i$j]), j=0..n/i)))
    end:
a:= n-> b(n$2, []):
seq(a(n), n=1..10);  # Alois P. Heinz, May 26 2013

g[n_, k_] := g[n, k] = If[n > k, 0, 1] + If[PrimeQ[n], 0, Sum[If[d > k, 0, g[n/d, d]], {d, Divisors[n] ~Complement~ {1, n}}]]; b[n_, i_, l_] := If[n == 0, g[p = Product[Prime[t]^l[[t]], {t, 1, Length[l]}], p], If[i < 1, 0, Sum[b[n - i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}]]]; a[n_] := b[n, n, {}]; Table[Print[an = a[n]]; an, {n, 1, 13}] (* Jean-François Alcover, Dec 12 2013, after Alois P. Heinz *)

EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
D(p, n)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); my(u=EulerT(v)); Vec(1/prod(k=1, n, 1 - u[k]*x^k + O(x*x^n))-1, -n)/prod(i=1, #v, i^v[i]*v[i]!)}
seq(n)={my(s=0); forpart(p=n, s+=D(p,n)); s} \\ Andrew Howroyd, Dec 30 2020

from sympy.core.cache import cacheit
from sympy import divisors, isprime, prime
from operator import mul
@cacheit
def g(n, k):
    return (0 if n > k else 1) + (0 if isprime(n) else sum(g(n//d, d) for d in divisors(n)[1:-1] if d <= k))
@cacheit
def b(n, i, l):
    if n==0:
        p = reduce(mul, (prime(t + 1)**l[t] for t in range(len(l))))
        return g(p, p)
    else:
        return 0 if i<1 else sum([b(n - i*j, i - 1, l + [i]*j) for j in range(n//i + 1)])
def a(n):
    return b(n, n, [])
for n in range(1, 11): print(a(n)) # Indranil Ghosh, Aug 19 2017, after Maple code

More terms from Erich Friedman.
81199 from Alford Arnold, Mar 04 2008
a(10) from Alford Arnold, Mar 31 2008
a(10) corrected by Alford Arnold, Aug 07 2008
a(11)-a(13) from Alois P. Heinz, May 26 2013
a(14) from Alois P. Heinz, Sep 27 2014
a(15) from Alois P. Heinz, Jan 10 2015
Terms a(16) and beyond from Andrew Howroyd, Dec 30 2020

A330475 Number of balanced reduced multisystems whose atoms constitute a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 2, 9, 85, 1143, 25270

Offset: 0

Gus Wiseman, Dec 27 2019

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.

A finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

			The a(0) = 1 through a(3) = 9 multisystems:
  {}  {1}  {1,1}  {1,1,1}
           {1,2}  {1,1,2}
                  {1,2,3}
                  {{1},{1,1}}
                  {{1},{1,2}}
                  {{1},{2,3}}
                  {{2},{1,1}}
                  {{2},{1,3}}
                  {{3},{1,2}}

The (weakly) normal version is A330655.
The maximum-depth case is A330675.
The case where the atoms are {1..n} is A005121.
The case where the atoms are all 1's is A318813.
The tree version is A330471.
Multiset partitions of strongly normal multisets are A035310.
Cf. A000311, A000669, A001678, A316652, A318812, A330467, A330474, A330628, A330663, A330679.

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];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

A330655 Number of balanced reduced multisystems of weight n whose atoms cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 2, 12, 138, 2652, 78106, 3256404, 182463296, 13219108288, 1202200963522, 134070195402644, 17989233145940910, 2858771262108762492, 530972857546678902490, 113965195745030648131036, 27991663753030583516229824, 7800669355870672032684666900, 2448021231611414334414904013956

Offset: 0

Gus Wiseman, Dec 27 2019

nonn

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem. The weight of an atom is 1, while the weight of a multiset is the sum of weights of its elements.

			The a(0) = 1 through a(3) = 12 multisystems:
  {}  {1}  {1,1}  {1,1,1}
           {1,2}  {1,1,2}
                  {1,2,2}
                  {1,2,3}
                  {{1},{1,1}}
                  {{1},{1,2}}
                  {{1},{2,2}}
                  {{1},{2,3}}
                  {{2},{1,1}}
                  {{2},{1,2}}
                  {{2},{1,3}}
                  {{3},{1,2}}

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

Row sums of A330776.
The unlabeled version is A330474.
The strongly normal case is A330475.
The tree version is A330654.
The maximum-depth case is A330676.
The case where the atoms are all different is A005121.
The case where the atoms are all equal is A318813.
Multiset partitions of normal multisets are A255906.
Series-reduced rooted trees with normal leaves are A316651.
Cf. A000311, A000669, A001678, A213427, A318812, A330675, A330679.

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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
R(n,k)={my(v=vector(n), u=vector(n)); v[1]=k; for(n=1, #v, u += v*sum(j=n, #v, (-1)^(j-n)*binomial(j-1,n-1)); v=EulerT(v)); u}
seq(n)={concat([1], sum(k=1, n, R(n, k)*sum(r=k, n, binomial(r, k)*(-1)^(r-k))))} \\ Andrew Howroyd, Dec 30 2019

Terms a(7) and beyond from Andrew Howroyd, Dec 30 2019

A330663 Number of non-isomorphic balanced reduced multisystems of weight n and maximum depth.

Original entry on oeis.org

1, 1, 2, 4, 20, 140, 1411

Offset: 0

Gus Wiseman, Dec 27 2019

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem. The weight of an atom is 1, while the weight of a multiset is the sum of weights of its elements.

			Non-isomorphic representatives of the a(2) = 2 through a(4) = 20 multisystems:
  {1,1}  {{1},{1,1}}  {{{1}},{{1},{1,1}}}
  {1,2}  {{1},{1,2}}  {{{1,1}},{{1},{1}}}
         {{1},{2,3}}  {{{1}},{{1},{1,2}}}
         {{2},{1,1}}  {{{1,1}},{{1},{2}}}
                      {{{1}},{{1},{2,2}}}
                      {{{1,1}},{{2},{2}}}
                      {{{1}},{{1},{2,3}}}
                      {{{1,1}},{{2},{3}}}
                      {{{1}},{{2},{1,1}}}
                      {{{1,2}},{{1},{1}}}
                      {{{1}},{{2},{1,2}}}
                      {{{1,2}},{{1},{2}}}
                      {{{1}},{{2},{1,3}}}
                      {{{1,2}},{{1},{3}}}
                      {{{1}},{{2},{3,4}}}
                      {{{1,2}},{{3},{4}}}
                      {{{2}},{{1},{1,1}}}
                      {{{2}},{{1},{1,3}}}
                      {{{2}},{{3},{1,1}}}
                      {{{2,3}},{{1},{1}}}

The non-maximal version is A330474.
Labeled versions are A330675 (strongly normal) and A330676 (normal).
The case where the leaves are sets (as opposed to multisets) is A330677.
The case with all atoms distinct is A000111.
The case with all atoms equal is (also) A000111.
Cf. A000311, A004114, A005121, A006472, A007716, A048816, A141268, A306186, A330470, A330655, A330664.

A330665 Number of balanced reduced multisystems of maximal depth whose atoms are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 3, 1, 5, 1, 1, 1, 7, 1, 1, 1, 5, 1, 3, 1, 2, 2, 1, 1, 16, 1, 2, 1, 2, 1, 5, 1, 5, 1, 1, 1, 11, 1, 1, 2, 16, 1, 3, 1, 2, 1, 3, 1, 27, 1, 1, 2, 2, 1, 3, 1, 16, 2, 1, 1, 11, 1

Offset: 1

Gus Wiseman, Dec 27 2019

nonn

First differs from A317145 at a(32) = 5, A317145(32) = 4.
A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.
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.
Also series/singleton-reduced factorizations of n with Omega(n) levels of parentheses. See A001055, A050336, A050338, A050340, etc.

			The a(n) multisystems for n = 2, 6, 12, 24, 48:
  {1}  {1,2}  {{1},{1,2}}  {{{1}},{{1},{1,2}}}  {{{{1}}},{{{1}},{{1},{1,2}}}}
              {{2},{1,1}}  {{{1,1}},{{1},{2}}}  {{{{1}}},{{{1,1}},{{1},{2}}}}
                           {{{1}},{{2},{1,1}}}  {{{{1},{1}}},{{{1}},{{1,2}}}}
                           {{{1,2}},{{1},{1}}}  {{{{1},{1,1}}},{{{1}},{{2}}}}
                           {{{2}},{{1},{1,1}}}  {{{{1,1}}},{{{1}},{{1},{2}}}}
                                                {{{{1}}},{{{1}},{{2},{1,1}}}}
                                                {{{{1}}},{{{1,2}},{{1},{1}}}}
                                                {{{{1},{1}}},{{{2}},{{1,1}}}}
                                                {{{{1},{1,2}}},{{{1}},{{1}}}}
                                                {{{{1,1}}},{{{2}},{{1},{1}}}}
                                                {{{{1}}},{{{2}},{{1},{1,1}}}}
                                                {{{{1},{2}}},{{{1}},{{1,1}}}}
                                                {{{{1,2}}},{{{1}},{{1},{1}}}}
                                                {{{{2}}},{{{1}},{{1},{1,1}}}}
                                                {{{{2}}},{{{1,1}},{{1},{1}}}}
                                                {{{{2},{1,1}}},{{{1}},{{1}}}}

The last nonzero term in row n of A330667 is a(n).
The chain version is A317145.
The non-maximal version is A318812.
Unlabeled versions are A330664 and A330663.
Other labeled versions are A330675 (strongly normal) and A330676 (normal).
Cf. A001055, A005121, A005804, A050336, A213427, A292505, A317144, A318849, A320160, A330474, A330475, A330679.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

a(2^n) = A000111(n - 1).

a(product of n distinct primes) = A006472(n).

A330676 Number of balanced reduced multisystems of weight n and maximum depth whose atoms cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 2, 8, 70, 1012, 21944, 665708, 26917492, 1399033348, 90878863352, 7214384973908, 687197223963640, 77354805301801012, 10158257981179981304, 1539156284259756811748, 266517060496258245459352, 52301515332984084095078308, 11546416513975694879642736152

Offset: 0

Gus Wiseman, Dec 30 2019

nonn

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem. The weight of an atom is 1, while the weight of a multiset is the sum of weights of its elements.

A finite multiset is normal if it covers an initial interval of positive integers.

			The a(0) = 1 through a(3) = 8 multisystems:
  {}  {1}  {1,1}  {{1},{1,1}}
           {1,2}  {{1},{1,2}}
                  {{1},{2,2}}
                  {{1},{2,3}}
                  {{2},{1,1}}
                  {{2},{1,2}}
                  {{2},{1,3}}
                  {{3},{1,2}}

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

Row sums of A330778.
The case with all atoms equal is A000111.
The case with all atoms different is A006472.
The version allowing all depths is A330655.
The unlabeled version is A330663.
The version where the atoms are the prime indices of n is A330665.
The strongly normal version is A330675.
The version where the degrees are the prime indices of n is A330728.
Multiset partitions of normal multisets are A255906.
Series-reduced rooted trees with normal leaves are A316651.
Cf. A000669, A001055, A005121, A005804, A318812, A330469, A330474, A330654, A330664, A330677, A330679.

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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
R(n, k)={my(v=vector(n), u=vector(n)); v[1]=k; for(n=1, #v, for(i=n, #v, u[i] += v[i]*(-1)^(i-n)*binomial(i-1, n-1)); v=EulerT(v)); u}
seq(n)={concat([1], sum(k=1, n, R(n, k)*sum(r=k, n, binomial(r, k)*(-1)^(r-k))))} \\ Andrew Howroyd, Dec 30 2020

Terms a(8) and beyond from Andrew Howroyd, Dec 30 2019

A330625 Number of series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with multiset union a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 3, 14, 123, 1330, 19694

Offset: 0

Gus Wiseman, Dec 25 2019

A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes.

A finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

			The a(1) = 1 through a(3) = 14 trees:
  {1}  {1,2}      {1,2,3}
       {{1},{1}}  {{1},{1,2}}
       {{1},{2}}  {{1},{2,3}}
                  {{2},{1,3}}
                  {{3},{1,2}}
                  {{1},{1},{1}}
                  {{1},{1},{2}}
                  {{1},{2},{3}}
                  {{1},{{1},{1}}}
                  {{1},{{1},{2}}}
                  {{1},{{2},{3}}}
                  {{2},{{1},{1}}}
                  {{2},{{1},{3}}}
                  {{3},{{1},{2}}}

The generalization where the leaves are multisets is A330467.
The singleton-reduced case is A330628.
The unlabeled version is A330624.
The case with all atoms distinct is A005804.
The case with all atoms equal is A196545.
The case where all leaves are singletons is A330471.
Cf. A000669, A004111, A141268, A300660, A316652, A330469, A330475, A330626, A330668, A330675.

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];
srtrees[m_]:=Prepend[Join@@Table[Tuples[srtrees/@p],{p,Select[mps[m],Length[#1]>1&]}],m];
Table[Sum[Length[Select[srtrees[s],FreeQ[#,{_,x_Integer,x_Integer,_}]&]],{s,strnorm[n]}],{n,0,5}]

A330664 Number of non-isomorphic balanced reduced multisystems of maximum depth whose degrees (atom multiplicities) are the weakly decreasing prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 1, 4, 5, 5, 7, 16, 16, 27, 2, 61, 33, 272, 27, 123, 61, 1385, 27, 78, 272, 95, 123, 7936, 362

Offset: 1

Gus Wiseman, Dec 28 2019

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.

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. A multiset whose multiplicities are the prime indices of n (such as row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

			Non-isomorphic representatives of the a(n) multisystems for n = 2, 3, 6, 9, 10, 12 (commas and outer brackets elided):
  1  11  {1}{12}  {{1}}{{1}{22}}  {{1}}{{1}{12}}  {{1}}{{1}{23}}
         {2}{11}  {{11}}{{2}{2}}  {{11}}{{1}{2}}  {{11}}{{2}{3}}
                  {{1}}{{2}{12}}  {{1}}{{2}{11}}  {{1}}{{2}{13}}
                  {{12}}{{1}{2}}  {{12}}{{1}{1}}  {{12}}{{1}{3}}
                                  {{2}}{{1}{11}}  {{2}}{{1}{13}}
                                                  {{2}}{{3}{11}}
                                                  {{23}}{{1}{1}}

The non-maximal version is A330666.
The case of constant or strict atoms is A000111.
Labeled versions are A330728, A330665 (prime indices), and A330675 (strongly normal).
Non-isomorphic multiset partitions whose degrees are the prime indices of n are A318285.
Cf. A004114, A005121, A007716, A048816, A141268, A306186, A318846, A318848, A330470, A330474, A330663.

For n > 1, a(2^n) = a(prime(n)) = A000111(n - 1).

A330728 Number of balanced reduced multisystems of maximum depth whose degrees (atom multiplicities) are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 3, 7, 5, 5, 11, 16, 16, 27, 18, 61, 62, 272, 45, 123, 61, 1385, 105, 152, 272, 501, 211, 7936, 362

Offset: 1

Gus Wiseman, Dec 30 2019

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.

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. A multiset whose multiplicities are the prime indices of n (such as row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

			The a(n) multisystems for n = 3, 6, 8, 9, 10, 12 (commas and outer brackets elided):
  11  {1}{12}  {1}{23}  {{1}}{{1}{22}}  {{1}}{{1}{12}}  {{1}}{{1}{23}}
      {2}{11}  {2}{13}  {{11}}{{2}{2}}  {{11}}{{1}{2}}  {{11}}{{2}{3}}
               {3}{12}  {{1}}{{2}{12}}  {{1}}{{2}{11}}  {{1}}{{2}{13}}
                        {{12}}{{1}{2}}  {{12}}{{1}{1}}  {{12}}{{1}{3}}
                        {{2}}{{1}{12}}  {{2}}{{1}{11}}  {{1}}{{3}{12}}
                        {{2}}{{2}{11}}                  {{13}}{{1}{2}}
                        {{22}}{{1}{1}}                  {{2}}{{1}{13}}
                                                        {{2}}{{3}{11}}
                                                        {{23}}{{1}{1}}
                                                        {{3}}{{1}{12}}
                                                        {{3}}{{2}{11}}

The version with distinct atoms is A006472.
The non-maximal version is A318846.
A tree version is A318848, with orderless version A318849.
The unlabeled version is A330664.
Final terms in each row of A330727.
See also A330675 (strongly normal), A330676 (normal), and A330726 (partition).
Cf. A000111, A001055, A005121, A292504, A292505, A317145, A330665, A330666.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[Reverse[FactorInteger[n]],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

a(2^n) = A006472(n).

a(prime(n)) = A000111(n - 1).

A330726 Number of balanced reduced multisystems of maximum depth whose atoms are positive integers summing to n.

Original entry on oeis.org

1, 1, 2, 3, 7, 17, 54, 199, 869, 4341, 24514, 154187

Offset: 0

Gus Wiseman, Jan 03 2020

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.

			The a(1) = 1 through a(5) = 17 multisystems (commas elided):
  {1}  {2}   {3}        {4}               {5}
       {11}  {12}       {22}              {23}
             {{1}{11}}  {13}              {14}
                        {{1}{12}}         {{1}{13}}
                        {{2}{11}}         {{1}{22}}
                        {{{1}}{{1}{11}}}  {{2}{12}}
                        {{{11}}{{1}{1}}}  {{3}{11}}
                                          {{{1}}{{1}{12}}}
                                          {{{11}}{{1}{2}}}
                                          {{{1}}{{2}{11}}}
                                          {{{12}}{{1}{1}}}
                                          {{{2}}{{1}{11}}}
                                          {{{{1}}}{{{1}}{{1}{11}}}}
                                          {{{{1}}}{{{11}}{{1}{1}}}}
                                          {{{{1}{1}}}{{{1}}{{11}}}}
                                          {{{{1}{11}}}{{{1}}{{1}}}}
                                          {{{{11}}}{{{1}}{{1}{1}}}}

The case with all atoms equal to 1 is A000111.
The non-maximal version is A330679.
A tree version is A320160.
Cf. A000669, A002846, A005121, A141268, A196545, A213427, A317145, A318813, A330663, A330665, A330675, A330676, A330728.

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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

cp's OEIS Frontend

A035310 Let f(n) = number of ways to factor n = A001055(n); a(n) = sum of f(k) over all terms k in A025487 that have n factors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Extensions

A330475 Number of balanced reduced multisystems whose atoms constitute a strongly normal multiset of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330655 Number of balanced reduced multisystems of weight n whose atoms cover an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A330663 Number of non-isomorphic balanced reduced multisystems of weight n and maximum depth.

Views

Author

Keywords

Comments

Examples

Crossrefs

A330665 Number of balanced reduced multisystems of maximal depth whose atoms are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A330676 Number of balanced reduced multisystems of weight n and maximum depth whose atoms cover an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A330625 Number of series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with multiset union a strongly normal multiset of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330664 Number of non-isomorphic balanced reduced multisystems of maximum depth whose degrees (atom multiplicities) are the weakly decreasing prime indices of n.

Views

Author

Keywords

Comments

Examples