|
Search: id:A126189
|
|
|
| A126189 |
|
Number of hex trees with n edges and no adjacent vertices of outdegree 2. A hex tree is a rooted tree where each vertex has 0, 1, or 2 children and, when only one child is present, it is either a left child, or a middle child, or a right child (name due to an obvious bijection with certain tree-like polyhexes; see the Harary-Read reference). |
|
+0
2
|
|
| 1, 3, 10, 36, 135, 519, 2034, 8100, 32688, 133380, 549342, 2280690, 9534591, 40103019, 169583382, 720549432, 3074694552, 13170845916, 56616211818, 244144402182, 1055875341888, 4578616787256, 19903066450722, 86713862341590
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n)=A126188(n,0).
|
|
REFERENCES
|
F. Harary and R. C. Read, The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. (2) 17 (1970), 1-13.
|
|
FORMULA
|
G.f.=[1-3z-6z^3-sqrt(1-6z+9z^2-12z^3)]/(18z^4).
|
|
MAPLE
|
g:=1/18/z^4*(1-3*z-6*z^3-sqrt(1+9*z^2-6*z-12*z^3)): gser:=series(g, z=0, 30): seq(coeff(gser, z, n), n=0..26);
|
|
CROSSREFS
|
Cf. A126188.
Sequence in context: A119374 A126188 A081909 this_sequence A122448 A007582 A026854
Adjacent sequences: A126186 A126187 A126188 this_sequence A126190 A126191 A126192
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 25 2006
|
|
|
Search completed in 0.002 seconds
|
