There are 2n points marked on a circle. We want to divide them into pairs and connect the points in each pair by a segment (chord) such that these segments do not intersect.
Let be the number of ways to do this.
Write a recurrence relation for .
I worked out up to n=5:
I had worked out to be but this failed when I worked out n=5.