|
|
A052319
|
|
Number of increasing rooted trimmed trees with n nodes.
|
|
7
|
|
|
1, 1, 1, 2, 7, 28, 131, 720, 4513, 31824, 249513, 2151744, 20242983, 206313024, 2264425179, 26628836352, 334022337153, 4451717814528, 62820790592913, 935750983412736, 14672143677452679, 241555066200437760
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
In an increasing rooted tree, nodes are numbered and numbers increase as you move away from root.
A trimmed tree is a tree with a forbidden limb of length 2.
A tree with a forbidden limb of length k is a tree where the path from any leaf inward hits a branching node or another leaf within k steps.
Number of permutations on [n+1] beginning with 12 and avoiding a consecutive 132 pattern (n>=1). For example, a(4)=2 counts 12345, 12453. - Ralf Stephan, Apr 25 2004
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: A(x) = 1/B(-x) where B'(x) is e.g.f. of A006882 and B(0) = 1.
E.g.f.: A(x) satisfies A'(x) = exp(A(x)-x^2/2).
E.g.f.: exp(-x^2/2)/(1-int[0..x, exp(-x^2/2)]). - Ralf Stephan, Apr 25 2004
Limit n->infinity (a(n)/n!)^(1/n) = 1/(sqrt(2)*InverseErf(sqrt(2/Pi))) = 1/A240885 = 0.7839769312035474991... - Vaclav Kotesovec, Jan 07 2014
a(n) ~ (n-1)! / (sqrt(2)*InverseErf(sqrt(2/Pi)))^n. - Vaclav Kotesovec, Aug 22 2014
|
|
MAPLE
|
seq(n! * coeff(series(-log(1-sqrt(Pi/2)*erf(x/sqrt(2))), x, n+1), x, n), n=1..20) # Vaclav Kotesovec, Jan 07 2014
|
|
MATHEMATICA
|
Rest[CoefficientList[Series[-Log[1-Sqrt[Pi/2]*Erf[x/Sqrt[2]]], {x, 0, 20}], x] * Range[0, 20]!] (* Vaclav Kotesovec, Jan 07 2014 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,eigen
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|