|
| |
|
|
A054514
|
|
Number of ways to place non-crossing diagonals in convex (n+4)-gon so as to create no triangles or quadrilaterals.
|
|
1
| |
|
|
1, 1, 1, 5, 10, 16, 45, 109, 222, 540, 1341, 3065, 7328, 18112, 43530, 105390, 260254, 639244, 1570257, 3893805, 9669236
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
LINKS
| L. Smiley, Generalization and some variants
|
|
|
FORMULA
| a(n) = Sum_{j=0..(n-1)/3} binomial[n-2j-1, n-3j-1] binomial[n+3+j, n+2]/(n+3). This counts the polygon dissections above by number j of diagonals. - David Callan (callan(AT)stat.wisc.edu), Jul 15 2004
|
|
|
EXAMPLE
| a(4)=5 because the octagon has the null placement and four ways to place a single diagonal.
|
|
|
MATHEMATICA
| InverseSeries[Series[(y-y^2-y^4)/(1-y), {y, 0, 24}], x] (* then A(x)=[y(x)-x]/x^3 *)
|
|
|
CROSSREFS
| A046736, A049124, A003168, A054515.
Sequence in context: A026059 A115002 A152234 * A200940 A002660 A050321
Adjacent sequences: A054511 A054512 A054513 * A054515 A054516 A054517
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Len Smiley (smiley(AT)math.uaa.alaska.edu), Apr 08 2000
|
| |
|
|
