Computation Workshop Solution Checker

Consecutive Sums

Let \(f(N)\) denote the number of ways to express \(N\) as a sum of two or more consecutive positive integers. For example \(f(15)=3\) because \(15\) can be expressed as a sum of consecutive positive integer in \(3\) different ways:
\(15 = 7+8 = 4+5+6 = 1+2+3+4+5\)