Number of different sets ("cut sets") of triangles a regular (n+2)-gon can be dissected into; two triangulations of an (n+2)-gon are equal if all numbers of congruent triangles coincide.

A033961

Number of different sets ("cut sets") of triangles a regular (n+2)-gon can be dissected into; two triangulations of an (n+2)-gon are equal if all numbers of congruent triangles coincide.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =2a(4) =4a(5) =6a(6) =11a(7) =17a(8) =35a(9) =57a(10) =115a(11) =203a(12) =412a(13) =745a(14) =1546a(15) =2838a(16) =5901a(17) =11154a(18) =23255a(19) =44263a(20) =93169a(21) =179214a(22) =377441a(23) =733151a(24) =1547068a(25) =3020878a(26) =6399874a(27) =12543862

External references