|
Search: id:A120348
|
|
|
| A120348 |
|
Number of labeled simply-rooted 2-trees with n labeled vertices (i.e. n+2 vertices altogether; a simply-rooted 2-tree is an externally rooted 2-tree whose root edge belongs to exactly one triangle). |
|
+0
1
|
|
| 1, 8, 156, 4896, 212520, 11793600, 797448960, 63606090240, 5846743244160, 608588457523200, 70758332701056000, 9088747467351552000, 1278179579224720972800, 195333707771834926694400
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
E. M. Palmer and R. C. Read, On the number of plane 2-trees, J. London Math. Soc. (2), 6, 1973, 583-592.
|
|
FORMULA
|
a(n)=(5n-2)!/(4n-1)! E.g.f. T=T(x) satisfies T(1-T)^4=x.
|
|
MAPLE
|
seq((5*n-2)!/(4*n-1)!, n=1..16);
|
|
CROSSREFS
|
Sequence in context: A113268 A089669 A113668 this_sequence A025605 A114223 A127369
Adjacent sequences: A120345 A120346 A120347 this_sequence A120349 A120350 A120351
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 24 2006
|
|
|
Search completed in 0.002 seconds
|
