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)$.
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
11 months ago