How many ways are there to stack coins on top of the other (2D stack) without any coin falling down ?
Here’s an example for $n=3$:
Now this is most likely just like the monotonic path of Catalan number with up and down instead of up and right but I just don’t get why is that ? Well, any advice would be appreciated.
A picture is worth a thousand words, they say: