Suppose you have an equilateral triangle divided into 9 smaller equilateral triangles as shown, with the bottom side horizontal. Starting from the top corner labeled $A$, you must walk to the bottom right corner labeled $B$, and are only allowed to take steps along the edges down to the left, down to the right, or horizontally to the right. Determine the number of possible paths.

![](https://cdn.mathpix.com/cropped/2024_04_17_f3b4fb3fc1d2fb8de6a1g-1.jpg?height=468&width=505&top_left_y=1905&top_left_x=821)
The number of paths from the top vertex to itself or to any vertex on the left side of the triangle is 1 . For each other vertex, the number of paths can be found by adding the number of paths to the vertex directly to its left and to the
two vertices above it. Thus, the following triangle of numbers tells us the number of paths to each vertex, where each number represents a vertex:

![](https://cdn.mathpix.com/cropped/2024_04_17_f3b4fb3fc1d2fb8de6a1g-2.jpg?height=274&width=267&top_left_y=432&top_left_x=946)

The bottom right number is 22 , so the number of paths to the bottom right corner is 22 .