Number of ways to partition the set of vertices of a convex n-gon into non-intersecting directed polygons.

A350599

Number of ways to partition the set of vertices of a convex n-gon into non-intersecting directed polygons.

Terms

    a(0) =2a(1) =2a(2) =2a(3) =14a(4) =30a(5) =50a(6) =170a(7) =462a(8) =1014a(9) =2810a(10) =7906a(11) =19910a(12) =53278a(13) =148514a(14) =397530a(15) =1073918a(16) =2976390a(17) =8172426a(18) =22413266a(19) =62219830a(20) =172846382a(21) =479683762a(22) =1338281802a(23) =3743620974a(24) =10475828630a(25) =29389158426a(26) =82643684034a(27) =232644515366a(28) =655928162878

External references