Number of ways to partition the set of vertices of a convex {n+8}-gon into 3 non-intersecting polygons.

A350116

Number of ways to partition the set of vertices of a convex {n+8}-gon into 3 non-intersecting polygons.

Terms

    a(0) =0a(1) =12a(2) =45a(3) =110a(4) =220a(5) =390a(6) =637a(7) =980a(8) =1440a(9) =2040a(10) =2805a(11) =3762a(12) =4940a(13) =6370a(14) =8085a(15) =10120a(16) =12512a(17) =15300a(18) =18525a(19) =22230a(20) =26460a(21) =31262a(22) =36685a(23) =42780a(24) =49600a(25) =57200a(26) =65637a(27) =74970a(28) =85260a(29) =96570

External references