A033961 - OEIS

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.

1, 1, 2, 2, 4, 6, 11, 17, 35, 57, 115, 203, 412, 745, 1546, 2838, 5901, 11154, 23255, 44263, 93169, 179214, 377441, 733151, 1547068, 3020878, 6399874, 12543862

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,3

REFERENCES

Iuliana Dochkova-Todorova, Computer Methods and New Values for Cut Set Catalan Numbers, ICEST (2012), 206-207.

J. Dochkowa, H. Harborth and I. Mengersen, Cut set Catalan numbers, Congressus Numerantium, Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998). Congr. Numer. 130 (1998), 133-139.

LINKS

Table of n, a(n) for n=2..29.

Sean A. Irvine, Java program (github)

CROSSREFS

Sequence in context: A293014 A124346 A300797 * A298163 A201542 A363251

Adjacent sequences: A033958 A033959 A033960 * A033962 A033963 A033964

KEYWORD

nonn,more

AUTHOR

Heiko Harborth (i1031901(AT)ws.rz.tu-bs.de)

EXTENSIONS

a(20)-a(29) from Dochkova-Todorova added by Sean A. Irvine, Jul 26 2020

STATUS

approved