Given the list of counting numbers, what is the largest amount of consecutive consecutive sums of equal value that can be found? Is there a limit?
For example,
[1, 2] and [3] are two consecutive consecutive numbers that both add up to 3.
(If somebody understands the question and has a better way of phrasing, please do help me rephrase this.)
You can't have more than two.
There is this pattern: $1+2=3,4+5+6=7+8,9+10+11+12=13+14+15,...$
where the first sequence goes from $n^2$ to $n(n+1)$, but it's only two in a row.
Multiply by eight, then $$8[(m+1)+(m+2)+...+n]=8\left[\frac{n(n+1)}2-\frac{m(m+1)}2\right]=(2n+1)^2-(2m+1)^2$$ So a sequence of three of these will have $$(2n+1)^2-(2m+1)^2=(2p+1)^2-(2n+1)^2=(2q+1)^2-(2p+1)^2$$ so you have four squares in arithmetic progression.
This link shows you can't have four squares in arithmetic progression.