A003456 -id:A003456 - cp's OEIS frontend

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

1, 1, 2, 3, 9, 20, 75, 262, 1117, 4783, 21971, 102249, 489077, 2370142, 11654465, 57916324, 290693391, 1471341341, 7504177738, 38532692207, 199076194985, 1034236705992, 5400337050086, 28329240333758, 149244907249629

Offset: 0

N. J. A. Sloane

Original name: number of symmetric dissections of a polygon.

Also number of 2-connected outerplanar graphs on n unlabeled nodes. - Steven Finch, Dec 09 2004

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
Guanzhang Hu, Group theory method for enumeration of outerplanar graphs, Acta Math. Appl. Sinica 14 (1998) 381-387.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..200
S. R. Finch, Planar graph growth constants.
Steven R. Finch, Planar graph growth constants [Cached copy, with permission of the author]
E. Krasko, A. Omelchenko, Brown's Theorem and its Application for Enumeration of Dissections and Planar Trees, The Electronic Journal of Combinatorics, 22 (2015), #P1.17.
P. Lisonek, Closed forms for the number of polygon dissections, Journal of Symbolic Computation 20 (1995), 595-601.
T. Motzkin, The hypersurface cross ratio, Bull. Amer. Math. Soc., 51 (1945), 976-984.
T. S. Motzkin, Relations between hypersurface cross ratios and a combinatorial formula for partitions of a polygon, for permanent preponderance and for non-associative products, Bull. Amer. Math. Soc., 54 (1948), 352-360.
R. C. Read, On general dissections of a polygon, Preprint (1974)
Ronald C. Read, On general dissections of a polygon, Aequat. math. 18 (1978) 370-388.
James Tilley, Stan Wagon, and Eric Weisstein, A Catalog of Facially Complete Graphs, arXiv:2409.11249 [math.CO], 2024. See pp. 7,11.

Cf. A003454, A003455, A003456, A005036, A295260.

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)

\\ See A295419 for DissectionsModDihedral().
my(v=DissectionsModDihedral(apply(i->1, [1..30])));v[3..#v] \\ Andrew Howroyd, Nov 22 2017

More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 21 2005

Name clarified by Andrew Howroyd, Nov 22 2017

A003454 Number of nonequivalent dissections of an n-gon by nonintersecting diagonals rooted at a cell up to rotation.

Original entry on oeis.org

1, 2, 6, 25, 107, 509, 2468, 12258, 61797, 315830, 1630770, 8498303, 44629855, 235974495, 1255105304, 6710883952, 36050676617, 194478962422, 1053120661726, 5722375202661, 31191334491891, 170504130213135, 934495666529380, 5134182220623958, 28270742653671621

Offset: 3

N. J. A. Sloane

nonn

Total number of dissections of an n-gon into polygons without reflection and rooted at a cell. - Sean A. Irvine, May 14 2015

Say two n-gons are equivalent (or in the same convexity class) if there is a bijection between the edges and vertices which preserves inclusion of vertices and edges, preserves the handedness of the polygon (does not reflect the polygon over a line), maps vertices of the convex hulls to each other, and induces an equivalence on each nontrivially connected component of Hull(X) \ X. This sequence is the number of convexity classes for an n-gon, up to rotation. - Griffin N. Macris, Mar 02 2021

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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.

Cf. A001004, A003455, A003456, A005033, A295222.

Cf. A003442.

\\ See A003442 for DissectionsModCyclicRooted.
DissectionsModCyclicRooted(apply(i->1, [1..30])) \\ Andrew Howroyd, Nov 22 2017

G.f.: -f(x) - (f(x)^2 + f(x^2))/2 + Sum_{k>=1} (phi(k)/k)*log(1/(1 - f(x^k))), where phi(k) is Euler's Totient function and f(x) = (1 + x - sqrt(1 - 6x + x^2))/4 is related to the o.g.f. for A001003. - Griffin N. Macris, Mar 02 2021

More terms from Sean A. Irvine, May 14 2015

Name clarified by Andrew Howroyd, Nov 22 2017

A003455 Number of nonequivalent dissections of an n-gon by nonintersecting diagonals up to rotation.

Original entry on oeis.org

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

Offset: 3

N. J. A. Sloane

nonn

Total number of dissections of an n-gon into polygons without reflection. - Sean A. Irvine, May 15 2015

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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.

Cf. A001004, A003454, A003456, A005034, A295224, A295495.

\\ See A295495 for DissectionsModCyclic().
DissectionsModCyclic(apply(v->1, [1..30])) \\ Andrew Howroyd, Nov 22 2017

More terms from Sean A. Irvine, May 15 2015

Name clarified by Andrew Howroyd, Nov 22 2017

A003447 Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.

Original entry on oeis.org

1, 2, 7, 26, 108, 434, 1765, 7086, 28384, 113092, 449582, 1783092, 7062611, 27944394, 110494113, 436699670, 1725474562, 6816591452, 26927828642, 106375090796, 420248084468, 1660408588852, 6561147261682, 25930381015756, 102496390643352, 405212762977544

Offset: 4

N. J. A. Sloane

nonn

Number of dissections of regular n-gon into n-3 polygons with reflection and rooted at a cell. - Sean A. Irvine, May 13 2015

The dissection will always be composed of one quadrilateral and n-4 triangles. - Andrew Howroyd, Nov 24 2017

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 4..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.

Cf. A003448, A003452, A003456.

DissectionsModDihedralRooted(v)={my(n=#v);
my(q=vector(n)); q[1]=serreverse(x-sum(i=3, #v, x^i*v[i])/x + O(x*x^n));
for(i=2, n, q[i]=q[i-1]*q[1]);
my(vars=variables(q[1]));
my(u(m, r)=substvec(q[r]+O(x^(n\m+1)), vars, apply(t->t^m, vars)));
my(R=sum(i=1, (#v-1)\2, v[2*i+1]*u(2, i)), Q=sum(i=2, #v\2, v[2*i]*u(2, i-1)), T=sum(i=3, #v, my(c=v[i]); if(c, c*sumdiv(i, d, eulerphi(d)*u(d, i/d))/i)));
my(p=O(x*x^n) + (R*(x+R)/(1-Q) + Q*(u(2,1)+(x+R)^2/(1-Q)^2)/2 + T)/2);
vector(n, i, polcoeff(p, i))}
my(v=DissectionsModDihedralRooted(apply(i->if(i>=3&&i<=4,y^(i-3)+O(y^2)),[1..25]))); apply(p->polcoeff(p,1), v[4..#v])

More terms from Sean A. Irvine, May 13 2015

Name clarified by Andrew Howroyd, Nov 24 2017

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A003454 Number of nonequivalent dissections of an n-gon by nonintersecting diagonals rooted at a cell up to rotation.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Formula

Extensions

A003455 Number of nonequivalent dissections of an n-gon by nonintersecting diagonals up to rotation.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Extensions

A003447 Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Extensions