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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =4a(5) =12a(6) =27a(7) =82a(8) =228a(9) =733a(10) =2282a(11) =7528a(12) =24834a(13) =83898a(14) =285357a(15) =983244a(16) =3412420a(17) =11944614a(18) =42080170a(19) =149197152a(20) =531883768a(21) =1905930975a(22) =6861221666a(23) =24806004996a(24) =90036148954a(25) =327989004892
External references
- oeis: A000207