|
Search: id:A067955
|
|
|
| A067955 |
|
Number of dissections of a convex polygon by nonintersecting diagonals into polygons with even number of sides and having a total number of n edges (sides and diagonals). |
|
+0
1
|
|
| 1, 0, 0, 1, 0, 1, 3, 1, 8, 13, 15, 56, 79, 157, 399, 624, 1448, 3061, 5571, 12826, 25559, 51608, 113828, 227954, 482591, 1031681, 2117323, 4542331, 9591243, 20119244, 43164172, 91165297, 193826856, 415024053, 881294603, 1886458874, 4038398755
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
Number of ordered trees with n-1 edges, all of whose nodes have odd outdegree greater than two.
|
|
FORMULA
|
a(n)=(1/n)sum(binomial(n, j)binomial((n-3-j)/2, j-1), j=1..floor((n-1)/3)) g.f. G(z) satisfies (1+z)G^3-zG^2-G+z=0
|
|
EXAMPLE
|
a(7)= 3 because the only dissections with 7 edges are given by a hexagon dissected by any of the three halving diagonals.
|
|
MAPLE
|
Order := 40: solve(series((G-G^3)/(1-G^2+G^3), G)=z, G);
|
|
CROSSREFS
|
Sequence in context: A019146 A102537 A131202 this_sequence A049965 A077108 A075847
Adjacent sequences: A067952 A067953 A067954 this_sequence A067956 A067957 A067958
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 06 2002
|
|
|
Search completed in 0.002 seconds
|
