A004114 -id:A004114 - cp's OEIS frontend

A330677 Number of non-isomorphic balanced reduced multisystems of weight n and maximum depth whose leaves (which are multisets of atoms) are sets.

1, 1, 1, 2, 11, 81, 859

Offset: 0

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. 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(0) = 1 through a(4) = 11 multisystems:
  {}  {1}  {1,2}  {{1},{1,2}}  {{{1}},{{1},{1,2}}}
                  {{1},{2,3}}  {{{1}},{{1},{2,3}}}
                               {{{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,3}}}
                               {{{2,3}},{{1},{1}}}

The version with all distinct atoms is A000111.
Non-isomorphic set multipartitions are A049311.
The (non-maximal) tree version is A330626.
Allowing leaves to be multisets gives A330663.
The case with prescribed degrees is A330664.
The version allowing all depths is A330668.
Cf. A000669, A001678, A004114, A005121, A007716, A141268, A283877, A306186, A330465, A330470, A330624.

A004113 Number of rooted trees with n nodes and 2-colored non-leaf nodes.

Original entry on oeis.org

1, 2, 6, 18, 60, 204, 734, 2694, 10162, 38982, 151920, 599244, 2389028, 9608668, 38945230, 158904230, 652178206, 2690598570, 11151718166, 46412717826, 193891596436, 812748036380, 3417407089470, 14410094628558, 60920843101858, 258169745573158, 1096494947168142

Offset: 1

N. J. A. Sloane

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 1..500
F. Harary, R. W. Robinson and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc., Series A, 20 (1975), 483-503. Errata: Vol. A 41 (1986), p. 325.
N. J. A. Sloane, Transforms
Index entries for sequences related to rooted trees
Index entries for sequences related to trees

Cf. A004114, A052316, A052317.

with(numtheory): etr:= proc(p) local b; b:= proc(n) option remember; `if`(n=0, 1, (add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n))/n) end end: b:= etr(a): a:= n-> `if`(n<=1, n, 2*b(n-1)): seq(a(n), n=1..30); # Alois P. Heinz, Sep 06 2008

etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[j]}]*b[n - j], {j, 1, n}]/n ]; b]; b = etr[a]; a[n_] := If[n <= 1, n, 2*b[n - 1]]; Table[a[n], {n, 1, 27}] (* Jean-François Alcover, Jan 29 2013, translated from Alois P. Heinz's Maple program *)

Shifts left and halves under EULER transform.

a(n) ~ c * d^n / n^(3/2), where d = 4.49415643203339504537343052838796824... and c = 0.368722987377516657464802259... - Vaclav Kotesovec, Feb 28 2014

Extended with better description from Christian G. Bower, Apr 15 1998

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

A330627 Number of non-isomorphic phylogenetic trees with n nodes.

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 4, 5, 9, 14, 24, 39, 69, 116, 205, 357, 632, 1118, 2001, 3576, 6445, 11627, 21080, 38293, 69819, 127539, 233644, 428825, 788832, 1453589, 2683602, 4962167, 9190155, 17044522, 31655676, 58866237, 109600849, 204293047, 381212823, 712073862

Offset: 1

Gus Wiseman, Dec 28 2019

nonn

A phylogenetic tree is a series-reduced rooted tree whose leaves are (usually disjoint) sets. Each branching as well as each element of each leaf contributes to the number of nodes.

			Non-isomorphic representatives of the a(2) = 1 through a(9) = 9 trees (commas and outer brackets elided):
  1  12  123  1234    12345    123456     1234567      12345678
              (1)(2)  (1)(23)  (1)(234)   (1)(2345)    (1)(23456)
                               (12)(34)   (12)(345)    (12)(3456)
                               (1)(2)(3)  (1)(2)(34)   (123)(456)
                                          (1)((2)(3))  (1)(2)(345)
                                                       (1)(23)(45)
                                                       (1)((2)(34))
                                                       (1)(2)(3)(4)
                                                       (12)((3)(4))

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

Phylogenetic trees by number of labels are A005804, with unlabeled version A141268.
Balanced phylogenetic trees are A320154.
Cf. A000311, A000669, A001678, A004114, A005121, A007716, A048816, A060356, A330465, A330467, A330469.

EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
seq(n)={my(v=[0]); for(n=1, n-1, v=concat(v, EulerT(v)[n] - v[n] + 1)); v} \\ Andrew Howroyd, Jan 02 2021

G.f.: A(x) satisfies A(x) = x*(1/(1-x) - A(x) - 2 + exp(Sum_{k>0} A(x^k)/k)). - Andrew Howroyd, Jan 02 2021

Terms a(11) and beyond from Andrew Howroyd, Jan 02 2021

A052316 Number of labeled rooted trees with n nodes and 2-colored internal (non-leaf) nodes.

Original entry on oeis.org

1, 4, 30, 344, 5370, 106452, 2562182, 72592816, 2367054450, 87320153900, 3595646533182, 163492924997448, 8136172620013802, 439858024910227588, 25670670464821310070, 1608575860476990991712, 107716675117341985862370

Offset: 1

Christian G. Bower, Dec 15 1999

N. J. A. Sloane, Transforms
Index entries for sequences related to rooted trees

Cf. A004113, A004114, A052317.

a[n_] := Sum[j^(n-1)*2^j*(-1)^(n-j)*Binomial[n, j], {j, 1, n}]; a[1] = 1; Table[a[n], {n, 1, 17}] (* Jean-François Alcover, Feb 26 2013, after Vladimir Kruchinin *)

a(n):=if n=1 then 1 else sum(j^(n-1)*2^j*(-1)^(n-j)*binomial(n,j),j,1,n); /* Vladimir Kruchinin, Jan 24 2012 */

Divides by 2n and shifts left under exponential transform.
E.g.f.: -x-LambertW(-2*x*exp(-x)). - Vladeta Jovovic, Sep 17 2003
a(n) = sum(j=1..n, j^(n-1)*2^j*(-1)^(n-j)*binomial(n,j)), n>1, a(1)=1. - Vladimir Kruchinin, Jan 24 2012
a(n) ~ sqrt(1+LambertW(-exp(-1)/2)) * n^(n-1) / (exp(n)*(-LambertW(-exp(-1)/2))^n). - Vaclav Kotesovec, Oct 05 2013

A052317 Number of labeled trees with n nodes and 2-colored internal (non-leaf) nodes.

Original entry on oeis.org

1, 1, 1, 6, 56, 730, 12372, 259574, 6511920, 190413234, 6364960940, 239556803662, 10028763883272, 462366507311306, 23282257730716740, 1271520006077859750, 74865320814990626912, 4727699146425478764898, 318763676354643090937692, 22856568223852002933212798

Offset: 0

Christian G. Bower, Dec 15 1999

nonn

Index entries for sequences related to trees

Cf. A004113, A004114, A052316.

CoefficientList[Series[1+(1-x)*(-x-LambertW[-2*x*E^(-x)])-(-x-LambertW[-2*x*E^(-x)])^2/2, {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Oct 05 2013 *)

E.g.f.: 1 + B(x) - x*B(x) - B(x)^2/2 where B(x) is e.g.f. of A052316.

a(n) ~ (1+LambertW(-exp(-1)/2))^(3/2) * n^(n-2) / (exp(n)*(-LambertW(-exp(-1)/2))^n). - Vaclav Kotesovec, Oct 05 2013

cp's OEIS Frontend

A330677 Number of non-isomorphic balanced reduced multisystems of weight n and maximum depth whose leaves (which are multisets of atoms) are sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A004113 Number of rooted trees with n nodes and 2-colored non-leaf nodes.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A330627 Number of non-isomorphic phylogenetic trees with n nodes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions

A052316 Number of labeled rooted trees with n nodes and 2-colored internal (non-leaf) nodes.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Maxima

Formula

A052317 Number of labeled trees with n nodes and 2-colored internal (non-leaf) nodes.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula