Yes. An informal proof is not difficult to demonstrate.
Numbers that have an odd prime will have at least one sequence of consecutive numbers that returns its sum. Powers of two (2) are the only numbers that do not have odd primes, so there are no consecutive numbers that add to a power of two (2)
Contradiction (proof part 1).
Defining N as the sum of an odd number of consecutive numbers. An odd number of consecutive numbers will have as its average a whole number, that is the middle number. For this, N = a whole number (the average) * odd number (number of consecutive numbers). This means N has an odd number factor. If \(N = 2^k\) then (N) cannot have an odd number factor. Proof by contradiction that no odd number of consecutive numbers will sum to N, if \(N = 2^k\)
Contradiction (proof part 2)
Defining N as the sum of an even number of consecutive numbers.
An even number of consecutive numbers will have an average that is half the sum of its two middle numbers.
\(N= \frac{(m_1 + m_2)\leftarrow \tiny \text{middle nmbs}}{2} * \text {even # (number of consecutive numbers)}\\ N = (m_1 + m_2) *\frac{1}{2} * \text {even number}\\\)
The sum of any two consecutive numbers is odd. This odd number is a factor of (N).
If \(N=2^k\) then (N) cannot have an odd number factor. Proof by contradiction that no even number of consecutive numbers will sum to N, if \(N = 2^k \)
GA