How many ways are there of writing $n$ as a sum of odd integers, where the order doesn't matter? For example, there are $2$ ways of writing $3$: $(1,1,1)$ and $(3)$.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top