

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.


0



1, 1, 2, 2, 4, 6, 11, 17, 35, 57, 115, 203, 412, 745, 1546, 2838, 5901, 11154
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,3


REFERENCES

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


LINKS

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


CROSSREFS

Sequence in context: A293014 A124346 A300797 * A298163 A201542 A000672
Adjacent sequences: A033958 A033959 A033960 * A033962 A033963 A033964


KEYWORD

nonn


AUTHOR

Heiko Harborth (i1031901(AT)ws.rz.tubs.de)


STATUS

approved



