For each number from 1 to 35, how do you find all the ways to write it as a sum of two or more consecutive numbers?
1 Answer
See below for one approach:
Explanation:
I'm going to assume that we are limiting the numbers to integers.
Let's try a few and see if we can spot a pattern:
and so on.
Let's now run through the different ways we can sum numbers:
Only positive integers starting from 0
This gives us:
The next number in this series is 36 and so doesn't work.
Only positive integers not starting from 0 (or 1)
First off, we get a doubling of the sums above (since starting from 1 doesn't change the sum itself). But we are now free to start from other positive integers:
Including negative integers
If we include negative integers, like we did in the examples at the start of the answer, we'll first have a way to sum to every integer from 1 to 35.
We can also use smaller summations of negative integers against bigger summations of positive integers starting from 0 to sum to other numbers. This will, in effect, double the list of sums in the "not starting from 0" category (for example, I can sum
In the end:

each number can be achieved once by adding negative integers to the sum so that only the single positive integer remains (like we did with this:
#4=3+(2)+(1)+0+1+2+3+4# (with the exception being 1  we can't add a negative to it and have it work) 
each number in the lists above represents 2 ways it can be achieved.
In the case of starting from 0, we can also start from 1 (the only exception to this being the number 1  it needs the 0 so that it has something to sum against).
In the case of not starting from 0, we can add negative integers to achieve the same result.
And so, sum total, each number can be achieved this number of ways: