The rod cutting problem states that: Given a rod of length $n$ inches and a table of prices $P_i$ for $i=1,\dots,n$, determine the maximum revenue $R_n$.
In CLRS chapter 15 Rod cutting page 360:
We can cut up a rod of length $n$ in $2^{n-1}$ different ways
I can intuitively understand why this is so; basically we can construct a binary tree of height $\log N$. But can someone provide me a proof of why this is so?