Consider a shortest path along the edges of a square grid from its bottom-left vertex to its top-right vertex. How many such paths have no edge above the grid diagonal that joins these vertices?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This is equal to the seventh Catalan number C 7 , which is 8 1 ⋅ ( 7 1 4 ) = 4 2 9 .