|
Search: id:A036771
|
|
|
| A036771 |
|
Number of labeled rooted trees with a degree constraint: (3*n)!/(6^n))*binomial(3*n+1,n). |
|
+0
2
|
|
| 1, 4, 420, 201600, 264264000, 734557824000, 3723191087616000, 31125877492469760000, 399532678960326912000000, 7462849882264211635200000000, 194563959280510261541299200000000, 6847568575944052279580806348800000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
L. Takacs, Enumeration of rooted trees and forests, Math. Scientist 18 (1993), 1-10, esp. Eq. (12).
|
|
LINKS
|
Index entries for sequences related to rooted trees
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 47
|
|
FORMULA
|
E.g.f.: -(1/2)/x*((-3*x+((-8+9*x^3)/x)^(1/2))*x^2)^(1/3)-1/((-3*x+((-8+9*x^3)/x)^(1/2))*x^2)^(1/3)-1/2*I*3^(1/2)*(1/x*((-3*x+((-8+9*x^3)/x)^(1/2))*x^2)^(1/3)-2/((-3*x+((-8+9*x^3)/x)^(1/2))*x^2)^(1/3))
Recurrence: {a(0)=0, a(2)=0, (-9*n^4-45*n^3-63*n^2-27*n)*a(n)+(8*n+28)*a(n+3)}
|
|
MAPLE
|
spec := [S, {S=Union(Z, Prod(Z, Set(S, card=3)))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Cf. A036770.
Sequence in context: A116031 A115049 A158111 this_sequence A080321 A125760 A053780
Adjacent sequences: A036768 A036769 A036770 this_sequence A036772 A036773 A036774
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
