AoPSWiki

Art of Problem Solving celebrates the many
accomplishments of its students and community members.

Personal tools

Search

Toolbox

Catalan sequence

From AoPSWiki

The Catalan sequence is a sequence of positive integers that arise as the solution to a wide variety of combinatorial problems. The first few terms of the Catalan sequence are $C_0 = 1$ , $C_1 = 1$ , $C_2 = 2$ , $C_3 = 5$ , .... In general, the $n$ th term of the Catalan sequence is given by the formula $C_n = \frac{1}{n + 1}\binom{2n}{n}$ , where $\binom{2n}{n}$ is the $n$ th central binomial coefficient.

Contents

1 Introduction
- 1.1 Example
- 1.2 Solution
2 See Also
3 External Links

Introduction

The Catalan sequence can be used to find:

The number of ways to arrange $n$ pairs of matching parentheses.
The number of ways a convex polygon of $n+2$ sides can be split into $n$ triangles by $n - 1$ nonintersection diagonals.
The number of rooted binary trees with exactly $n+1$ leaves.

Example

In how many ways can the product of $n$ ordered number be calculated by pairs? For example, the possible ways for $a\cdot b\cdot c\cdot d$ are $a((bc)d), a(b(cd)), (ab)(cd), ((ab)c)d,$ and $(a(bc))d$ .

Solution

See Also

External Links

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/Catalan_sequence"

Category: Combinatorics

Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us