23. A person is climbing a staircase with a total of $n$ steps. If it is stipulated that he can only climb 1 step or 3 steps at a time, how many different ways are there to climb the stairs?
23. $\sum_{k=0}^{\left\lfloor\frac{n}{3}\right\rfloor}\binom{n-2 k}{k}$.