How many partitions of [n] into two blocks are there? How many partitions of [n] into n-1 blocks are there?

There are $\displaystyle \sum_{k=1}^{floor(\frac{n}{2})}\left({n\atop k}\right)$ partitions of [n] into two blocks (floor(n/2) is the greatest integer less than or equal to (n/2)).

There are $\displaystyle \left({n\atop n-2}\right)$ partitions of [n] into n-1 blocks.

Did I get this one correct?