A116379 Number of ternary rooted identity (distinct subtrees) trees with n nodes.

1, 1, 1, 2, 3, 6, 12, 25, 52, 113, 245, 542, 1205, 2707, 6113, 13907, 31780, 73010, 168399, 389991, 906231, 2112742, 4939689, 11580640, 27216387, 64110091, 151334814, 357938832, 848153045, 2013190671, 4786210412, 11396004660, 27172368314, 64875527649

Offset: 1

Author

Karen A. Yeats, Feb 06 2006

Keywords

• nonn

Comments

It is not known if these trees have the asymptotic form C rho^{-n} n^{-3/2}, whereas the identity binary trees, A063895, do, see the Jason P. Bell et al. reference.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..1000
• Jason P. Bell, Stanley N. Burris and Karen A. Yeats, Counting Rooted Trees: The Universal Law t(n) ~ C rho^{-n} n^{-3/2}, arXiv:math/0512432 [math.CO], 2005-2006.

Crossrefs

Cf. A004111, A063895, A116380.

Programs

C

#include  using namespace GiNaC; int main(){ int i, order = 40; symbol x("x"); ex T = x; for (i=0; i
				

Maple

A:= proc(n) option remember; local T; if n<=1 then x else T:= unapply(A(n-1), x); convert(series(x* (1+T(x)+ T(x)^2/2- T(x^2)/2+ T(x)^3/6- T(x)*T(x^2)/2+ T(x^3)/3), x, n+1), polynom) fi end: a:= n-> coeff(A(n), x, n): seq(a(n), n=1..40);  # Alois P. Heinz, Aug 22 2008

Mathematica

A[n_] := A[n] = If[n <= 1, x, T[y_] = A[n-1] /. x -> y; Normal[Series[y*(1+T[y]+T[y]^2/2-T[y^2]/2+T[y]^3/6-T[y]*T[y^2]/2+T[y^3]/3), {y, 0, n+1}]] /. y -> x] ; a[n_] := Coefficient[A[n], x, n]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Feb 13 2014, after Maple *)

Formula

G.f. satisfies: A(x) = x(1+A(x)+A(x)^2/2-A(x^2)/2+A(x)^3/6-A(x)A(x^2)/2+A(x^3)/3), that is A(x) = x(1+Set_{<=3}(A)(x)).