A330655 -id:A330655 - cp's OEIS frontend

A330474 Number of non-isomorphic balanced reduced multisystems of weight n.

1, 1, 2, 7, 48, 424

Offset: 0

Gus Wiseman, Dec 26 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(3) = 7 multisystems:
  {1,1,1}
  {1,1,2}
  {1,2,3}
  {{1},{1,1}}
  {{1},{1,2}}
  {{1},{2,3}}
  {{2},{1,1}}
Non-isomorphic representatives of the a(4) = 48 multisystems:
  {1,1,1,1}  {{1},{1,1,1}}    {{{1}},{{1},{1,1}}}
  {1,1,1,2}  {{1,1},{1,1}}    {{{1,1}},{{1},{1}}}
  {1,1,2,2}  {{1},{1,1,2}}    {{{1}},{{1},{1,2}}}
  {1,1,2,3}  {{1,1},{1,2}}    {{{1,1}},{{1},{2}}}
  {1,2,3,4}  {{1},{1,2,2}}    {{{1}},{{1},{2,2}}}
             {{1,1},{2,2}}    {{{1,1}},{{2},{2}}}
             {{1},{1,2,3}}    {{{1}},{{1},{2,3}}}
             {{1,1},{2,3}}    {{{1,1}},{{2},{3}}}
             {{1,2},{1,2}}    {{{1}},{{2},{1,1}}}
             {{1,2},{1,3}}    {{{1,2}},{{1},{1}}}
             {{1},{2,3,4}}    {{{1}},{{2},{1,2}}}
             {{1,2},{3,4}}    {{{1,2}},{{1},{2}}}
             {{2},{1,1,1}}    {{{1}},{{2},{1,3}}}
             {{2},{1,1,3}}    {{{1,2}},{{1},{3}}}
             {{1},{1},{1,1}}  {{{1}},{{2},{3,4}}}
             {{1},{1},{1,2}}  {{{1,2}},{{3},{4}}}
             {{1},{1},{2,2}}  {{{2}},{{1},{1,1}}}
             {{1},{1},{2,3}}  {{{2}},{{1},{1,3}}}
             {{1},{2},{1,1}}  {{{2}},{{3},{1,1}}}
             {{1},{2},{1,2}}  {{{2,3}},{{1},{1}}}
             {{1},{2},{1,3}}
             {{1},{2},{3,4}}
             {{2},{3},{1,1}}

Labeled versions are A330475 (strongly normal) and A330655 (normal).
The case where the atoms are all different is A318813.
The case where the atoms are all equal is (also) A318813.
The labeled case of set partitions is A005121.
The labeled case of integer partitions is A330679.
The case of maximal depth is A330663.
The version where leaves are sets (as opposed to multisets) is A330668.
Cf. A000311, A000669, A001678, A002846, A004114, A007716, A048816, A213427, A306186, A320154, A320160, A330470, A330666.

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

A330679 Number of balanced reduced multisystems whose atoms constitute an integer partition of n.

Original entry on oeis.org

1, 1, 2, 4, 12, 40, 180, 936, 5820, 41288, 331748, 2968688, 29307780, 316273976, 3704154568, 46788812168, 634037127612, 9174782661984, 141197140912208, 2302765704401360, 39671953757409256, 719926077632193848, 13726066030661998220, 274313334040504957368

Offset: 0

Gus Wiseman, Dec 31 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 a(0) = 1 through a(4) = 12 multisystems:
  {}  {1}  {2}    {3}          {4}
           {1,1}  {1,2}        {1,3}
                  {1,1,1}      {2,2}
                  {{1},{1,1}}  {1,1,2}
                               {1,1,1,1}
                               {{1},{1,2}}
                               {{2},{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..200

The case where the atoms are all 1's is A318813 = a(n)/2.
The version where the atoms constitute a strongly normal multiset is A330475.
The version where the atoms cover an initial interval is A330655.
The maximum-depth version is A330726.
Cf. A000041, A000111, A000669, A001970, A002846, A005121, A141268, A196545, A213427, A318812, A320160, A330474.

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(n > 1) = 2 * A318813(n).

a(12) onwards from Andrew Howroyd, Jan 20 2024

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.

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

A330654 Number of series/singleton-reduced rooted trees on normal multisets of size n.

Original entry on oeis.org

1, 1, 2, 12, 112, 1444, 24099, 492434, 11913985

Offset: 0

Gus Wiseman, Dec 26 2019

A series/singleton-reduced rooted tree on a multiset m is either the multiset m itself or a sequence of series/singleton-reduced rooted trees, one on each part of a multiset partition of m that is neither minimal (all singletons) nor maximal (only one part).
A finite multiset is normal if it covers an initial interval of positive integers.
First differs from A316651 at a(6) = 24099, A316651(6) = 24086. For example, ((1(12))(2(11))) and ((2(11))(1(12))) are considered identical for A316651 (series-reduced rooted trees), but {{{1},{1,2}},{{2},{1,1}}} and {{{2},{1,1}},{{1},{1,2}}} are different series/singleton-reduced rooted trees.

			The a(0) = 1 through a(3) = 12 trees:
  {}  {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}}

The orderless version is A316651.
The strongly normal case is A330471.
The unlabeled version is A330470.
The balanced version is A330655.
The case with all atoms distinct is A000311.
The case with all atoms equal is A196545.
Normal multiset partitions are A255906.
Cf. A000669, A004114, A005804, A281118, A316651, A330469, A330626, A330676.

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

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

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 6, 2, 10, 11, 20, 15, 90, 51, 80, 6, 468, 93, 2910, 80, 521, 277, 20644, 80, 334, 1761, 393, 521, 165874, 1374

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

			Non-isomorphic representatives of the a(2) = 1 through a(9) = 10 multisystems (commas and outer brackets elided):
    1  11  12  111      112      1111            123      1122
               {1}{11}  {1}{12}  {1}{111}        {1}{23}  {1}{122}
                        {2}{11}  {11}{11}                 {11}{22}
                                 {1}{1}{11}               {12}{12}
                                 {{1}}{{1}{11}}           {1}{1}{22}
                                 {{11}}{{1}{1}}           {1}{2}{12}
                                                          {{1}}{{1}{22}}
                                                          {{11}}{{2}{2}}
                                                          {{1}}{{2}{12}}
                                                          {{12}}{{1}{2}}
Non-isomorphic representatives of the a(12) = 15 multisystems:
  {1,1,2,3}
  {{1},{1,2,3}}
  {{1,1},{2,3}}
  {{1,2},{1,3}}
  {{2},{1,1,3}}
  {{1},{1},{2,3}}
  {{1},{2},{1,3}}
  {{2},{3},{1,1}}
  {{{1}},{{1},{2,3}}}
  {{{1,1}},{{2},{3}}}
  {{{1}},{{2},{1,3}}}
  {{{1,2}},{{1},{3}}}
  {{{2}},{{1},{1,3}}}
  {{{2}},{{3},{1,1}}}
  {{{2,3}},{{1},{1}}}

The labeled version is A318846.
The maximum-depth version is A330664.
Unlabeled balanced reduced multisystems by weight are A330474.
The case of constant or strict atoms is A318813.
Cf. A000669, A005121, A007716, A048816, A141268, A306186, A317791, A318812, A318849, A330470, A330475, A330655, A330728.

a(2^n) = a(prime(n)) = A318813(n).

A330667 Irregular triangle read by rows where T(n,k) is the number of balanced reduced multisystems of depth k whose atoms are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 2, 0, 1, 1, 0, 1, 0, 1, 3, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 0, 1, 0, 1, 1, 5, 5, 0, 1, 0, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 3, 0, 1, 1, 5, 9, 5, 0, 1, 0, 1, 0, 1, 0, 1, 7, 7, 0, 1, 1, 0, 1, 0, 1, 5, 5, 0, 1, 1, 3

Offset: 1

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 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.

			Triangle begins:
  {}
  1
  1
  1 0
  1
  1 0
  1
  1 1 0
  1 0
  1 0
  1
  1 2 0
  1
  1 0
  1 0
  1 3 2 0
  1
  1 2 0
  1
  1 2 0
Row n = 84 counts the following multisystems (commas elided):
  {1124}  {{1}{124}}    {{{1}}{{1}{24}}}
          {{11}{24}}    {{{11}}{{2}{4}}}
          {{12}{14}}    {{{1}}{{2}{14}}}
          {{2}{114}}    {{{12}}{{1}{4}}}
          {{4}{112}}    {{{1}}{{4}{12}}}
          {{1}{1}{24}}  {{{14}}{{1}{2}}}
          {{1}{2}{14}}  {{{2}}{{1}{14}}}
          {{1}{4}{12}}  {{{2}}{{4}{11}}}
          {{2}{4}{11}}  {{{24}}{{1}{1}}}
                        {{{4}}{{1}{12}}}
                        {{{4}}{{2}{11}}}

Row lengths are A001222.
Row sums are A318812.
The last nonzero term of row n is A330665(n).
Column k = 2 is 0 if n is prime; otherwise it is A001055(n) - 2.
Cf. A000311, A000669, A001678, A005121, A008827, A213427, A317145, A318846, A330474, A330475, A330655, A330666.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
totfac[n_,k_]:=If[k==1,1,Sum[totfac[Times@@Prime/@f,k-1],{f,Select[facs[n],1

A330776 Triangle read by rows: T(n,k) is the number of balanced reduced multisystems of weight n with atoms colored using exactly k colors.

Original entry on oeis.org

1, 1, 1, 2, 6, 4, 6, 37, 63, 32, 20, 262, 870, 1064, 436, 90, 2217, 12633, 27824, 26330, 9012, 468, 21882, 201654, 710712, 1163320, 895608, 262760, 2910, 249852, 3578610, 18924846, 47608000, 61786254, 40042128, 10270696, 20644, 3245520, 70539124, 538018360, 1950556400, 3792461176, 4070160416, 2275829088, 518277560

Offset: 1

Andrew Howroyd, Dec 30 2019

See A330655 for the definition of a balanced reduced multisystem.

A balanced reduced multisystem of weight n with atoms of k colors corresponds with a rooted tree with n leaves of k colors with all leaves at the same depth and at least one node at each level of the tree having more than one child. The final condition is needed to ensure that the number of such trees is finite.

			Triangle begins:
    1;
    1,     1;
    2,     6,      4;
    6,    37,     63,     32;
   20,   262,    870,   1064,     436;
   90,  2217,  12633,  27824,   26330,   9012;
  468, 21882, 201654, 710712, 1163320, 895608, 262760;
  ...
The T(3,2) = 6 balanced reduced multisystems are: {1,1,2}, {1,2,2}, {{1},{1,2}}, {{1},{2,2}}, {{2},{1,1}}, {{2},{1,2}}.

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

Column 1 is A318813.
Main diagonal is A005121.
Row sums are A330655.

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}
M(n)={my(v=vector(n, k, R(n, k)~)); Mat(vector(n, k, sum(i=1, k, (-1)^(k-i)*binomial(k, i)*v[i])))}
{my(T=M(10)); for(n=1, #T~, print(T[n, 1..n]))}

A330784 Triangle read by rows where T(n,k) is the number of balanced reduced multisystems of depth k with n equal atoms.

Original entry on oeis.org

1, 1, 1, 1, 3, 2, 1, 5, 9, 5, 1, 9, 28, 36, 16, 1, 13, 69, 160, 164, 61, 1, 20, 160, 580, 1022, 855, 272, 1, 28, 337, 1837, 4996, 7072, 4988, 1385

Offset: 2

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.

			Triangle begins:
    1
    1    1
    1    3    2
    1    5    9    5
    1    9   28   36   16
    1   13   69  160  164   61
    1   20  160  580 1022  855  272
    1   28  337 1837 4996 7072 4988 1385
Row n = 5 counts the following multisystems (strings of 1's are replaced by their lengths):
  5  {1,4}      {{1},{1,3}}      {{{1}},{{1},{1,2}}}
     {2,3}      {{1},{2,2}}      {{{1,1}},{{1},{2}}}
     {1,1,3}    {{2},{1,2}}      {{{1}},{{2},{1,1}}}
     {1,2,2}    {{3},{1,1}}      {{{1,2}},{{1},{1}}}
     {1,1,1,2}  {{1},{1,1,2}}    {{{2}},{{1},{1,1}}}
                {{1,1},{1,2}}
                {{2},{1,1,1}}
                {{1},{1},{1,2}}
                {{1},{2},{1,1}}

Row sums are A318813.
Column k = 3 is A007042.
Column k = 4 is A001970(n) - 3*A000041(n) + 3.
Column k = n is A000111.
Row n is row prime(n) of A330727.
Cf. A000669, A001055, A002846, A005121, A196545, A213427, A318812, A320160, A330474, A330475, A330655, A330667, 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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

T(n,3) = A000041(n) - 2.

T(n,4) = A001970(n) - 3 * A000041(n) + 3.

cp's OEIS Frontend

A330474 Number of non-isomorphic balanced reduced multisystems of weight n.

Views

Author

Keywords

Comments

Examples

Crossrefs

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330679 Number of balanced reduced multisystems whose atoms constitute an integer partition of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Crossrefs

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

A330654 Number of series/singleton-reduced rooted trees on normal multisets of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A330667 Irregular triangle read by rows where T(n,k) is the number of balanced reduced multisystems of depth k whose atoms are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330776 Triangle read by rows: T(n,k) is the number of balanced reduced multisystems of weight n with atoms colored using exactly k colors.

Views

Author

Keywords

Comments

Examples