cp's OEIS Frontend

A001004 Number of nonequivalent dissections of an (n+2)-gon by nonintersecting diagonals up to rotation and reflection.

%I A001004 M0898 N0339 #45 Sep 21 2024 08:44:05
%S A001004 1,1,2,3,9,20,75,262,1117,4783,21971,102249,489077,2370142,11654465,
%T A001004 57916324,290693391,1471341341,7504177738,38532692207,199076194985,
%U A001004 1034236705992,5400337050086,28329240333758,149244907249629
%N A001004 Number of nonequivalent dissections of an (n+2)-gon by nonintersecting diagonals up to rotation and reflection.
%C A001004 Original name: number of symmetric dissections of a polygon.
%C A001004 Also number of 2-connected outerplanar graphs on n unlabeled nodes. - _Steven Finch_, Dec 09 2004
%D A001004 Cameron, Peter J. Some treelike objects. Quart. J. Math. Oxford Ser. (2) 38 (1987), no. 150, 155--183. MR0891613 (89a:05009). See p. 155. - _N. J. A. Sloane_, Apr 18 2014
%D A001004 Guanzhang Hu, Group theory method for enumeration of outerplanar graphs, Acta Math. Appl. Sinica 14 (1998) 381-387.
%D A001004 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001004 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001004 Andrew Howroyd, <a href="/A001004/b001004.txt">Table of n, a(n) for n = 0..200</a>
%H A001004 S. R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/">Planar graph growth constants</a>.
%H A001004 Steven R. Finch, <a href="/A097999/a097999.pdf">Planar graph growth constants</a> [Cached copy, with permission of the author]
%H A001004 E. Krasko, A. Omelchenko, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p17">Brown's Theorem and its Application for Enumeration of Dissections and Planar Trees</a>, The Electronic Journal of Combinatorics, 22 (2015), #P1.17.
%H A001004 P. Lisonek, <a href="http://dx.doi.org/10.1006/jsco.1995.1066">Closed forms for the number of polygon dissections</a>, Journal of Symbolic Computation 20 (1995), 595-601.
%H A001004 T. Motzkin, <a href="http://dx.doi.org/10.1090/S0002-9904-1945-08486-9">The hypersurface cross ratio</a>, Bull. Amer. Math. Soc., 51 (1945), 976-984.
%H A001004 T. S. Motzkin, <a href="http://dx.doi.org/10.1090/S0002-9904-1948-09002-4 ">Relations between hypersurface cross ratios and a combinatorial formula for partitions of a polygon, for permanent preponderance and for non-associative products</a>, Bull. Amer. Math. Soc., 54 (1948), 352-360.
%H A001004 R. C. Read, <a href="/A001004/a001004.pdf">On general dissections of a polygon</a>, Preprint (1974)
%H A001004 Ronald C. Read, <a href="http://dx.doi.org/10.1007/BF03031688">On general dissections of a polygon</a>, Aequat. math. 18 (1978) 370-388.
%H A001004 James Tilley, Stan Wagon, and Eric Weisstein, <a href="https://arxiv.org/abs/2409.11249">A Catalog of Facially Complete Graphs</a>, arXiv:2409.11249 [math.CO], 2024. See pp. 7,11.
%t A001004 f[x_, n_]:=x+Sum[(1/r)*Binomial[s-2, r-1]*Binomial[r+s-1, s]*x^s, {r, 1, n}, {s, 2, n}]; F[x_, n_]:=Series[((3x^2-2*x*f[x, n]+f[x, n]^2)- (2+2*x+7*x^2-4*x*f[x, n]+2*f[x, n]^2)*f[x^2, n]+ 2*f[x^2, n]^2)/(4*(2*f[x^2, n]-1))+Sum[If[Mod[k, d]==0, EulerPhi[d]*f[x^d, n]^(k/d)/k, 0], {k, 3, n}, {d, 1, k}]/2, {x, 0, n}]; F[x, 22] (Finch)
%o A001004 (PARI) \\ See A295419 for DissectionsModDihedral().
%o A001004 my(v=DissectionsModDihedral(apply(i->1, [1..30])));v[3..#v] \\ _Andrew Howroyd_, Nov 22 2017
%Y A001004 Cf. A003454, A003455, A003456, A005036, A295260.
%K A001004 nonn,nice,easy
%O A001004 0,3
%A A001004 _N. J. A. Sloane_
%E A001004 More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 21 2005
%E A001004 Name clarified by _Andrew Howroyd_, Nov 22 2017