a(n) is the number of different ways to partition the set of vertices of a convex n-gon into 3 intersecting polygons.
A352474
a(n) is the number of different ways to partition the set of vertices of a convex n-gon into 3 intersecting polygons.
Terms
- a(0) =268a(1) =2055a(2) =10285a(3) =42515a(4) =157911a(5) =548912a(6) =1826846a(7) =5902458a(8) =18679974a(9) =58255005a(10) =179762211a(11) =550473301a(12) =1676299353a(13) =5083919214a(14) =15372833564a(15) =46383749572a(16) =139730014800a(17) =420448279875
External references
- oeis: A352474