The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003455 Number of nonequivalent dissections of an n-gon by nonintersecting diagonals up to rotation. (Formerly M0909) 6
 1, 2, 3, 11, 29, 122, 479, 2113, 9369, 43392, 203595, 975563, 4736005, 23296394, 115811855, 581324861, 2942579633, 15008044522, 77064865555, 398150807179, 2068470765261, 10800665952376, 56658467018647, 298489772155137, 1578702640556193 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,2 COMMENTS Total number of dissections of an n-gon into polygons without reflection. - Sean A. Irvine, May 15 2015 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 = 3..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 A295495 for DissectionsModCyclic(). DissectionsModCyclic(apply(v->1, [1..30])) \\ Andrew Howroyd, Nov 22 2017 CROSSREFS Cf. A001004, A003454, A003456, A005034, A295224, A295495. Sequence in context: A202211 A104081 A267902 * A103275 A278209 A195732 Adjacent sequences: A003452 A003453 A003454 * A003456 A003457 A003458 KEYWORD nonn AUTHOR N. J. A. Sloane EXTENSIONS More terms from Sean A. Irvine, May 15 2015 Name clarified by Andrew Howroyd, Nov 22 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 3 18:44 EDT 2023. Contains 363116 sequences. (Running on oeis4.)