Number of different ways to partition the set of vertices of a convex (n+11)-gon into 4 nonintersecting polygons.

A350286

Number of different ways to partition the set of vertices of a convex (n+11)-gon into 4 nonintersecting polygons.

Terms

    a(0) =0a(1) =55a(2) =286a(3) =910a(4) =2275a(5) =4900a(6) =9520a(7) =17136a(8) =29070a(9) =47025a(10) =73150a(11) =110110a(12) =161161a(13) =230230a(14) =322000a(15) =442000a(16) =596700a(17) =793611a(18) =1041390a(19) =1349950a(20) =1730575a(21) =2196040a(22) =2760736a(23) =3440800a(24) =4254250a(25) =5221125a(26) =6363630a(27) =7706286a(28) =9276085a(29) =11102650

External references