There are 3 ways to write 4 as a sum of odd numbers (assuming order matters and numbers can be repeated in the sum): , , and .
How many ways are there to write 20 as a sum of odd numbers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Partition of an Integer
It's interesting to note that the n th fibonacci number corresponds to the number of composition of n into odd parts. Proof - Page 259