A000207 - cp's OEIS frontend

A000207 Number of inequivalent ways of dissecting a regular (n+2)-gon into n triangles by n-1 non-intersecting diagonals under rotations and reflections; also the number of (unlabeled) maximal outerplanar graphs on n+2 vertices.

n	a(n)
1	1
2	1
3	1
4	3
5	4
6	12
7	27
8	82
9	228
10	733
11	2282
12	7528
13	24834
14	83898
15	285357
16	983244
17	3412420
18	11944614
19	42080170
20	149197152
21	531883768
22	1905930975
23	6861221666
24	24806004996
25	90036148954
26	327989004892
27	1198854697588
28	4395801203290
29	16165198379984
30	59609171366326
31	220373278174641

[1, 1, 1, 3, 4, 12, 27, 82, 228, 733, 2282, 7528, 24834, 83898, 285357, 983244, 3412420, 11944614, 42080170, 149197152, 531883768, 1905930975, 6861221666, 24806004996, 90036148954, 327989004892, 1198854697588, 4395801203290, 16165198379984, 59609171366326, 220373278174641]

cp's OEIS Frontend

A000207 Number of inequivalent ways of dissecting a regular (n+2)-gon into n triangles by n-1 non-intersecting diagonals under rotations and reflections; also the number of (unlabeled) maximal outerplanar graphs on n+2 vertices.

Table of values

List of values