OFFSET
5,2
COMMENTS
Number of dissections of regular n-gon into n-4 polygons without reflection and rooted at a cell. - Sean A. Irvine, May 05 2015
The conditions imposed mean that the dissection will always be composed of either 1 pentagon and n-5 triangles or 2 quadrilaterals and n-6 triangles. - Andrew Howroyd, Nov 23 2017
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Andrew Howroyd, Table of n, a(n) for n = 5..200
P. Lisonek, Closed forms for the number of polygon dissections, Journal of Symbolic Computation 20 (1995), 595-601.
Ronald C. Read, On general dissections of a polygon, Aequat. math. 18 (1978) 370-388.
PROG
(PARI) \\ See A003442 for DissectionsModCyclicRooted()
{ my(v=DissectionsModCyclicRooted(apply(i->if(i>=3&&i<=5, y^(i-3) + O(y^3)), [1..30]))); apply(p->polcoeff(p, 2), v[5..#v]) } \\ Andrew Howroyd, Nov 22 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, May 05 2015
Name clarified and offset changed by Andrew Howroyd, Nov 22 2017
STATUS
approved