This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005033 Number of nonequivalent dissections of a polygon into n quadrilaterals by nonintersecting diagonals rooted at a cell up to rotation. (Formerly M3921) 3
 1, 1, 5, 22, 116, 612, 3399, 19228, 111041, 650325, 3856892, 23107896, 139672312, 850624376, 5214734547, 32154708216, 199292232035, 1240877862315, 7758138260565, 48685766617950, 306558216362064, 1936246229757840, 12263985131919300, 77880114240872112 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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 = 1..200 F. Harary, E. M. Palmer, R. C. Read, On the cell-growth problem for arbitrary polygons, computer printout, circa 1974 F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389. CROSSREFS Column k=4 of A295222. Sequence in context: A164593 A153789 A213167 * A127618 A127619 A127620 Adjacent sequences:  A005030 A005031 A005032 * A005034 A005035 A005036 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Mar 11 2016 Name edited by Andrew Howroyd, Nov 20 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 25 03:50 EDT 2019. Contains 321450 sequences. (Running on oeis4.)