$ \newcommand{ifelse}[3]{ \left( \begin{cases} #1\text{ if }#2 \\ #3\text{ otherwise} \end{cases} \right) } $ A recent Numberphile video on 1+2+3+... has made this question ("Why?") popular again, as can be seen in the many related and duplicate questions.
But after puzzling a bit with this, it seems that the rules that they use in that video are inconsistent...
As far as I can see, they assume the existence of a sequence summation operator $\sum_n a_n$ which is just standard summation for convergent series, and which additionally obeys the following rules: \begin{align} & \sum_n (a\text{ with all zeroes removed})_n = \sum_n a_n \tag{0} \\ & \sum_n (c \times a_n + b_n) = c \times \sum_n a_n + \sum_n b_n \tag{1} \\ \end{align}
However, if I am not mistaken, these rules quickly lead to an inconsistency: \begin{alignat}{2} 0 &= \sum_n 1 - \sum_n 1 &&\text{(arithmetic, assuming $\;\sum_n 1\;$ exists)} \\ &= \sum_n 1 - \sum_n \ifelse{0}{n=0}{1} \quad &&\text{(inserting a 0 does not change the sum)} \\ &= \sum_n \ifelse{1}{n=0}{0} &&\text{(from (1))} \\ &= 1 &&\text{(convergent series)} \\ \end{alignat} Therefore my question is: Is there a set of consistent rules for a summation operator that allows us to compute $\;\sum_n n\;$ ("$1 + 2 + 3 + \dots$")? Does that work on all sequences, or do we have to exclude some (like perhaps $\;\sum_n 1\;$), and if so, which exactly?