a(n) is the number of different ways to partition the set of vertices of a convex n-gon into intersecting polygons.

A352900

a(n) is the number of different ways to partition the set of vertices of a convex n-gon into intersecting polygons.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =7a(4) =28a(5) =79a(6) =460a(7) =2486a(8) =11209a(9) =59787a(10) =361777a(11) =2167635a(12) =13577211a(13) =91919186a(14) =650059294a(15) =4761980740a(16) =36508824672a(17) =292116858616

External references