1547068
domain: N
Appears in sequences
- 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.at n=24A033961
- Number of level n squares on a Sierpinski carpet that are enclosed in a circle with the same center and diameter.at n=7A293288