A339645 -id:A339645 - cp's OEIS frontend

A330470 Number of non-isomorphic series/singleton-reduced rooted trees on a multiset of size n.

1, 1, 2, 7, 39, 236, 1836, 16123, 162008, 1802945, 22012335, 291290460, 4144907830, 62986968311, 1016584428612, 17344929138791, 311618472138440, 5875109147135658, 115894178676866576, 2385755803919949337, 51133201045333895149, 1138659323863266945177, 26296042933904490636133

Offset: 0

Gus Wiseman, Dec 22 2019

nonn

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

			Non-isomorphic representatives of the a(4) = 39 trees, with singleton leaves (x) replaced by just x:
  (1111)      (1112)      (1122)      (1123)      (1234)
  (1(111))    (1(112))    (1(122))    (1(123))    (1(234))
  (11(11))    (11(12))    (11(22))    (11(23))    (12(34))
  ((11)(11))  (12(11))    (12(12))    (12(13))    ((12)(34))
  (1(1(11)))  (2(111))    ((11)(22))  (2(113))    (1(2(34)))
              ((11)(12))  (1(1(22)))  (23(11))
              (1(1(12)))  ((12)(12))  ((11)(23))
              (1(2(11)))  (1(2(12)))  (1(1(23)))
              (2(1(11)))              ((12)(13))
                                      (1(2(13)))
                                      (2(1(13)))
                                      (2(3(11)))

The case with all atoms equal or all atoms different is A000669.
Not requiring singleton-reduction gives A330465.
Labeled versions are A316651 (normal orderless) and A330471 (strongly normal).
The case where the leaves are sets is A330626.
Row sums of A339645.
Cf. A000311, A005121, A005804, A141268, A213427, A292504, A292505, A318812, A318848, A318849, A330467, A330469, A330474, A330624.

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(v=vector(n)); v[1]=sv(1); for(n=2, #v, v[n] = polcoef( sEulerT(x*Ser(v[1..n])), n )); x*Ser(v)}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 11 2020

Terms a(7) and beyond from Andrew Howroyd, Dec 11 2020

A321283 Number of non-isomorphic multiset partitions of weight n in which the part sizes are relatively prime.

Original entry on oeis.org

1, 1, 2, 7, 21, 84, 214, 895, 2607, 9591, 31134, 119313, 400950, 1574123, 5706112, 22572991, 86933012, 356058243, 1427784135, 6044132304, 25342935667, 110414556330, 481712291885, 2166488898387, 9784077216457, 45369658599779, 211869746691055, 1011161497851296, 4871413403219085

Offset: 0

Gus Wiseman, Nov 06 2018

nonn

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which the row sums are relatively prime.
Also the number of non-isomorphic multiset partitions of weight n in which the multiset union of the parts is aperiodic, where a multiset is aperiodic if its multiplicities are relatively prime.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(4) = 21 multiset partitions with relatively prime part-sizes:
  {{1}}  {{1},{1}}  {{1},{1,1}}    {{1},{1,1,1}}
         {{1},{2}}  {{1},{2,2}}    {{1},{1,2,2}}
                    {{1},{2,3}}    {{1},{2,2,2}}
                    {{2},{1,2}}    {{1},{2,3,3}}
                    {{1},{1},{1}}  {{1},{2,3,4}}
                    {{1},{2},{2}}  {{2},{1,2,2}}
                    {{1},{2},{3}}  {{3},{1,2,3}}
                                   {{1},{1},{1,1}}
                                   {{1},{1},{2,2}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{1,2}}
                                   {{1},{2},{2,2}}
                                   {{1},{2},{3,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{1},{1},{1}}
                                   {{1},{1},{2},{2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}
Non-isomorphic representatives of the a(1) = 1 through a(4) = 21 multiset partitions with aperiodic multiset union:
  {{1}}  {{1,2}}    {{1,2,2}}      {{1,2,2,2}}
         {{1},{2}}  {{1,2,3}}      {{1,2,3,3}}
                    {{1},{2,2}}    {{1,2,3,4}}
                    {{1},{2,3}}    {{1},{2,2,2}}
                    {{2},{1,2}}    {{1,2},{2,2}}
                    {{1},{2},{2}}  {{1},{2,3,3}}
                    {{1},{2},{3}}  {{1,2},{3,3}}
                                   {{1},{2,3,4}}
                                   {{1,2},{3,4}}
                                   {{1,3},{2,3}}
                                   {{2},{1,2,2}}
                                   {{3},{1,2,3}}
                                   {{1},{1},{2,3}}
                                   {{1},{2},{2,2}}
                                   {{1},{2},{3,3}}
                                   {{1},{2},{3,4}}
                                   {{1},{3},{2,3}}
                                   {{2},{2},{1,2}}
                                   {{1},{2},{2},{2}}
                                   {{1},{2},{3},{3}}
                                   {{1},{2},{3},{4}}

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

Cf. A000740, A000837, A007716, A007916, A100953, A301700, A303386, A303431, A303546, A303547, A320800-A320810.

\\ See links in A339645 for combinatorial species functions.
seq(n)={my(A=symGroupSeries(n)); NumUnlabeledObjsSeq(sCartProd(sExp(A), 1 + sum(d=1, n, moebius(d) * (-1 + sExp(O(x*x^n) + sum(i=1, n\d, polcoef(A,i*d)*x^(i*d)))) )))} \\ Andrew Howroyd, Jan 17 2023

\\ faster self contained program.
EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={EulerT(Vec(sum(j=1, #q, my(g=gcd(t, q[j])); g*x^(q[j]/g)) + O(x*x^k), -k))}
a(n)={if(n==0, 1, my(s=0); forpart(q=n, my(u=vector(n, t, K(q, t, n\t))); s+=permcount(q)*polcoef(sum(d=1, n, moebius(d)*exp(sum(t=1, n\d, sum(i=1, n\(t*d), u[t][i*d]*x^(i*d*t))/t, O(x*x^n)) )), n)); s/n!)} \\ Andrew Howroyd, Jan 17 2023

a(n) = A007716(n) - A320810(n). - Andrew Howroyd, Jan 17 2023

Terms a(11) and beyond from Andrew Howroyd, Jan 17 2023

A317654 Number of free pure symmetric multifunctions whose leaves are a strongly normal multiset of size n.

Original entry on oeis.org

1, 3, 26, 375, 6696, 159837, 4389226, 144915350, 5377002075, 227624621051, 10632808475596, 550932945236121, 31062550998284221, 1907051034025848314, 126052420069459211076, 8956882232940915920404, 679298518935625486287703, 54868537321267493152151502, 4696952405203792017289469056

Offset: 1

Gus Wiseman, Aug 03 2018

nonn

A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. A free pure symmetric multifunction f in EPSM is either (case 1) a positive integer, or (case 2) an expression of the form h[g_1, ..., g_k] where k > 0, h is in EPSM, each of the g_i for i = 1, ..., k is in EPSM, and for i < j we have g_i <= g_j under a canonical total ordering of EPSM, such as the Mathematica ordering of expressions.

			The a(3) = 26 free pure symmetric multifunctions:
1[1[1]], 1[1,1], 1[1][1],
1[1[2]], 1[2[1]], 1[1,2], 2[1[1]], 2[1,1], 1[1][2], 1[2][1], 2[1][1],
1[2[3]], 1[3[2]], 1[2,3], 2[1[3]], 2[3[1]], 2[1,3], 3[1[2]], 3[2[1]], 3[1,2], 1[2][3], 2[1][3], 1[3][2], 3[1][2], 2[3][1], 3[2][1].

Cf. A001003, A052893, A053492, A255906, A277996, A279944, A280000.

Cf. A317652, A317653, A317655, A317656, A317658.

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]]]];
exprUsing[m_]:=exprUsing[m]=If[Length[m]==0,{},If[Length[m]==1,{First[m]},Join@@Cases[Union[Table[PR[m[[s]],m[[Complement[Range[Length[m]],s]]]],{s,Take[Subsets[Range[Length[m]]],{2,-2}]}]],PR[h_,g_]:>Join@@Table[Apply@@@Tuples[{exprUsing[h],Union[Sort/@Tuples[exprUsing/@p]]}],{p,mps[g]}]]]];
got[y_]:=Join@@Table[Table[i,{y[[i]]}],{i,Range[Length[y]]}];
Table[Sum[Length[exprUsing[got[y]]],{y,IntegerPartitions[n]}],{n,6}]

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + p*(sExp(p)-1)); p}
StronglyNormalLabelingsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Jan 01 2021

Terms a(8) and beyond from Andrew Howroyd, Jan 01 2021

A320810 Number of non-isomorphic multiset partitions of weight n whose part-sizes have a common divisor > 1.

Original entry on oeis.org

0, 2, 3, 12, 7, 84, 15, 410, 354, 3073, 56, 28300, 101, 210036, 126839, 2070047, 297, 25295952, 490, 269662769, 89071291, 3449056162, 1255, 51132696310, 400625539, 713071048480, 145126661415, 11351097702297, 4565, 199926713003444, 6842, 3460838122540969

Offset: 1

Gus Wiseman, Nov 15 2018

nonn

Also the number of nonnegative integer matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, in which the column sums are not relatively prime.
Also the number of non-isomorphic multiset partitions of weight n in which the multiset union of the parts is periodic, where a multiset is periodic if its multiplicities have a common divisor > 1.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(2) = 1 through a(5) = 7 multiset partitions whose part-sizes have a common divisor:
  {{1,1}}  {{1,1,1}}  {{1,1,1,1}}    {{1,1,1,1,1}}
  {{1,2}}  {{1,2,2}}  {{1,1,2,2}}    {{1,1,2,2,2}}
           {{1,2,3}}  {{1,2,2,2}}    {{1,2,2,2,2}}
                      {{1,2,3,3}}    {{1,2,2,3,3}}
                      {{1,2,3,4}}    {{1,2,3,3,3}}
                      {{1,1},{1,1}}  {{1,2,3,4,4}}
                      {{1,1},{2,2}}  {{1,2,3,4,5}}
                      {{1,2},{1,2}}
                      {{1,2},{2,2}}
                      {{1,2},{3,3}}
                      {{1,2},{3,4}}
                      {{1,3},{2,3}}
Non-isomorphic representatives of the a(2) = 1 through a(5) = 7 multiset partitions with periodic multiset union:
  {{1,1}}    {{1,1,1}}      {{1,1,1,1}}        {{1,1,1,1,1}}
  {{1},{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},{1},{1,1,1}}
                            {{1},{1,2,2}}      {{1},{1,1},{1,1}}
                            {{1,1},{2,2}}      {{1},{1},{1},{1,1}}
                            {{1,2},{1,2}}      {{1},{1},{1},{1},{1}}
                            {{1},{1},{1,1}}
                            {{1},{1},{2,2}}
                            {{1},{2},{1,2}}
                            {{1},{1},{1},{1}}
                            {{1},{1},{2},{2}}

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

Cf. A007716, A018783, A047966, A120733, A303546, A303547, A305563, A319149, A319162, A319164, A319810.

\\ See links in A339645 for combinatorial species functions.
seq(n)={my(A=symGroupSeries(n));Vec(OgfSeries(sCartProd(sExp(A), -sum(d=2, n, moebius(d) * (-1 + sExp(O(x*x^n) + sum(i=1, n\d, polcoef(A,i*d)*x^(i*d)))) ))), -n)} \\ Andrew Howroyd, Jan 17 2023

a(n) = A007716(n) - A321283(n). - Andrew Howroyd, Jan 17 2023

Terms a(11) and beyond from Andrew Howroyd, Jan 17 2023

A330467 Number of series-reduced rooted trees whose leaves are multisets whose multiset union is a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 4, 18, 154, 1614, 23733, 396190, 8066984, 183930948, 4811382339, 138718632336, 4451963556127, 155416836338920, 5920554613563841, 242873491536944706, 10725017764009207613, 505671090907469848248, 25415190929321149684700, 1354279188424092012064226

Offset: 0

Gus Wiseman, Dec 22 2019

nonn

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

Also the number of different colorings of phylogenetic trees with n labels using strongly normal multisets of colors. A phylogenetic tree is a series-reduced rooted tree whose leaves are (usually disjoint) sets.

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

The singleton-reduced version is A316652.
The unlabeled version is A330465.
Not requiring weakly decreasing multiplicities gives A330469.
The case where the leaves are sets is A330625.
Cf. A000311, A000669, A004114, A005121, A005804, A141268, A292504, A292505, A318812, A318849, A319312, A330471, A330475.

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]]]];
multing[t_,n_]:=Array[(t+#-1)/#&,n,1,Times];
amemo[m_]:=amemo[m]=1+Sum[Product[multing[amemo[s[[1]]],Length[s]],{s,Split[c]}],{c,Select[mps[m],Length[#]>1&]}];
Table[Sum[amemo[m],{m,strnorm[n]}],{n,0,5}]

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(v=vector(n), p=sExp(x*sv(1) + O(x*x^n))); v[1]=sv(1); for(n=2, #v, v[n] = polcoef( sExp(x*Ser(v[1..n])), n ) + polcoef(p, n)); 1 + x*Ser(v)}
StronglyNormalLabelingsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 28 2020

Terms a(10) and beyond from Andrew Howroyd, Dec 28 2020

A004115 Number of unlabeled rooted nonseparable graphs with n nodes.

Original entry on oeis.org

0, 1, 1, 4, 22, 178, 2278, 46380, 1578060, 92765486, 9676866173, 1821391854302, 625710416245358, 395761853562201960, 464128290507379386872, 1015085639712281997464676, 4160440039279630394986003604, 32088534920274236421098827156776

Offset: 1

N. J. A. Sloane

R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 1..40 (terms 1..26 from R. W. Robinson)
R. W. Robinson, Rooted non-separable graphs - computer printout

Cf. A002218, A007145, A013922.

\\ See links in A339645 for combinatorial species functions.
edges(v) = {sum(i=2, #v, sum(j=1, i-1, gcd(v[i], v[j]))) + sum(i=1, #v, v[i]\2)}
graphsCycleIndex(n)={my(s=0); forpart(p=n, s+=permcount(p) * 2^edges(p) * sMonomial(p)); s/n!}
graphsSeries(n)={sum(k=0, n, graphsCycleIndex(k)*x^k) + O(x*x^n)}
cycleIndexSeries(n)={my(g=graphsSeries(n), gcr=sPoint(g)/g); x*sSolve( sLog( gcr/(x*sv(1)) ), gcr )}
{ my(N=15); Vec(OgfSeries(cycleIndexSeries(N)), -N) } \\ Andrew Howroyd, Dec 25 2020

A316654 Number of series-reduced rooted identity trees whose leaves span an initial interval of positive integers with multiplicities an integer partition of n.

Original entry on oeis.org

1, 1, 5, 39, 387, 4960, 74088, 1312716, 26239484, 595023510, 14908285892, 412903136867, 12448252189622, 407804188400373, 14380454869464352, 544428684832123828, 21991444994187529639, 945234507638271696504, 43042162953650721470752, 2071216980365429970912347

Offset: 1

Gus Wiseman, Jul 09 2018

nonn

A rooted tree is series-reduced if every non-leaf node has at least two branches. It is an identity tree if no branch appears multiple times under the same root.

			The a(3) = 5 trees are (1(12)), (1(23)), (2(13)), (3(12)), (123).

Cf. A000081, A000311, A000669, A001678, A004111, A005804, A141268, A181821, A292504, A300660, A304660.

Cf. A316651, A316652, A316653, A316655, A316656.

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]]]];
gro[m_]:=If[Length[m]==1,m,Select[Union[Sort/@Join@@(Tuples[gro/@#]&/@Select[mps[m],Length[#]>1&])],UnsameQ@@#&]];
Table[Sum[Length[gro[m]],{m,Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n]}],{n,5}]

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(v=vector(n)); v[1]=sv(1); for(n=2, #v, v[n]=polcoef(sWeighT(x*Ser(v[1..n])), n)); x*Ser(v)}
StronglyNormalLabelingsSeq(cycleIndexSeries(12)) \\ Andrew Howroyd, Jan 22 2021

Terms a(9) and beyond from Andrew Howroyd, Jan 22 2021

A320173 Number of inequivalent colorings of series-reduced balanced rooted trees with n leaves.

Original entry on oeis.org

1, 2, 3, 12, 23, 84, 204, 830, 2940, 13397, 58794, 283132, 1377302, 7087164, 37654377, 209943842, 1226495407, 7579549767, 49541194089, 341964495985, 2476907459261, 18703210872343, 146284738788714, 1179199861398539, 9760466433602510, 82758834102114911, 717807201648148643

Offset: 1

Gus Wiseman, Oct 07 2018

nonn

A rooted tree is series-reduced if every non-leaf node has at least two branches, and balanced if all leaves are the same distance from the root.

			Inequivalent representatives of the a(1) = 1 through a(5) = 23 colorings:
  1  (11)  (111)    (1111)      (11111)
     (12)  (112)    (1112)      (11112)
           (123)    (1122)      (11122)
                    (1123)      (11123)
                    (1234)      (11223)
                  ((11)(11))    (11234)
                  ((11)(12))    (12345)
                  ((11)(22))  ((11)(111))
                  ((11)(23))  ((11)(112))
                  ((12)(12))  ((11)(122))
                  ((12)(13))  ((11)(123))
                  ((12)(34))  ((11)(223))
                              ((11)(234))
                              ((12)(111))
                              ((12)(112))
                              ((12)(113))
                              ((12)(123))
                              ((12)(134))
                              ((12)(345))
                              ((13)(122))
                              ((22)(111))
                              ((23)(111))
                              ((23)(114))

Cf. A000669, A005804, A048816, A079500, A119262, A120803, A141268, A244925, A319312.

Cf. A320154, A320155, A320160, A320174, A320175, A320179, A339645.

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=x*sv(1) + O(x*x^n), q=0); while(p, q+=p; p=sEulerT(p)-1-p); q}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 11 2020

Terms a(8) and beyond from Andrew Howroyd, Dec 11 2020

A318230 Number of inequivalent leaf-colorings of binary rooted trees with 2n + 1 nodes.

Original entry on oeis.org

1, 2, 4, 18, 79, 474, 3166, 24451, 208702, 1958407, 19919811, 217977667, 2547895961, 31638057367, 415388265571, 5743721766718, 83356613617031, 1265900592208029, 20064711719120846, 331153885800672577, 5679210649417608867, 101017359002718628295, 1860460510677429522171

Offset: 0

Gus Wiseman, Aug 21 2018

nonn

			Inequivalent representatives of the a(3) = 18 leaf-colorings of binary rooted trees with 7 nodes:
  (1(1(11)))  ((11)(11))
  (1(1(12)))  ((11)(12))
  (1(1(22)))  ((11)(22))
  (1(1(23)))  ((11)(23))
  (1(2(11)))  ((12)(12))
  (1(2(12)))  ((12)(13))
  (1(2(13)))  ((12)(34))
  (1(2(22)))
  (1(2(23)))
  (1(2(33)))
  (1(2(34)))

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

Cf. A000081, A001190, A001678, A003238, A004111, A111299, A290689, A304486.

Cf. A318226, A318227, A318228, A318229, A318231, A318234, A319590, A339645.

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(v=vector(n)); v[1]=sv(1); for(n=2, #v, my(p=x*Ser(v[1..n-1])); v[n]=polcoef(p^2 + if(n%2==0, sRaise(p,2)), n)/2); x*Ser(v)}
InequivalentColoringsSeq(cycleIndexSeries(20)) \\ Andrew Howroyd, Dec 11 2020

Terms a(5) and beyond from Andrew Howroyd, Dec 10 2020

A300626 Number of inequivalent colorings of free pure symmetric multifunctions (with empty expressions allowed) with n positions.

Original entry on oeis.org

1, 1, 3, 11, 43, 187, 872, 4375, 23258, 130485, 767348, 4710715, 30070205, 198983975, 1361361925, 9607908808, 69812787049, 521377973359, 3996036977270, 31389624598631, 252408597286705, 2075472033455894, 17434190966525003, 149476993511444023, 1307022313790487959

Offset: 0

Gus Wiseman, Aug 17 2018

nonn

A free pure symmetric multifunction (with empty expressions allowed) f in EOME is either (case 1) a positive integer, or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where k >= 0, h is in EOME, each of the g_i for i = 1, ..., k is in EOME, and for i < j we have g_i <= g_j under a canonical total ordering of EOME, such as the Mathematica ordering of expressions.

Also the number of inequivalent colorings of orderless Mathematica expressions with n positions.

			Inequivalent representatives of the a(3) = 11 colorings:
  1[1,1]  1[2,2]  1[1,2]  1[2,3]
  1[1[]]  1[2[]]
  1[][1]  1[][2]
  1[1][]  1[2][]
  1[][][]

Row sums of A304485.

Cf. A000612, A007716, A052893, A053492, A277996, A279944, A280000, A317652, A317655, A317656, A317676.

\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + x*p*sExp(p)); p}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 30 2020

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

cp's OEIS Frontend

A330470 Number of non-isomorphic series/singleton-reduced rooted trees on a multiset of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Extensions

A321283 Number of non-isomorphic multiset partitions of weight n in which the part sizes are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions

A317654 Number of free pure symmetric multifunctions whose leaves are a strongly normal multiset of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A320810 Number of non-isomorphic multiset partitions of weight n whose part-sizes have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions

A330467 Number of series-reduced rooted trees whose leaves are multisets whose multiset union is a strongly normal multiset of size n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A004115 Number of unlabeled rooted nonseparable graphs with n nodes.

Views

Author

Keywords

References

Links

Crossrefs

Programs

PARI

A316654 Number of series-reduced rooted identity trees whose leaves span an initial interval of positive integers with multiplicities an integer partition of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A320173 Number of inequivalent colorings of series-reduced balanced rooted trees with n leaves.

Views