Let be the number of ways that a convex polygon with *n* sides
can be triangulated using non-crossing diagonals. Verify that
, and . Calculate and .

- Find a way to calculate if you already know .
- Can you find a formula for ?

Wed Apr 21 08:26:07 EDT 1999