Mathematica, 29 bytes
A port of Luis Mendo's MATL algorithm. Unnamed function taking a list of numbers (or even more general objects) and returning
False. Tests whether sums of consecutive elements are all equal. Unfortunately
Rest choke on the empty list, so that has to be tested separately.
Mathematica, 33 bytes
Unnamed function taking a list of numbers (or even more general objects) and returning
False. The function
Differences[#,1,2] takes the differences, not of consecutive pairs of integers, but pairs of integers at distance two apart. Then we just check whether the resulting list has nothing other than zeros in it.
As a bonus, for one more byte (change the
#2), we get a function that inputs a list of integers and another positive integer
#2, and checks whether the input list is the result of interleaving
#2 constant sequences periodically with one another. For example,