The Euler summation of numerical series

A combinatorial equality was proved, which involves k-order differences and binomial coefficients as well. The Euler's summing of a sequence connects with calculation of all differences. Regularity of summing function means the coincidence with “ordinary” sum, if the last exists. As a consequence of proving combinatorial equality the simple proof of regularity Euler's summing was given.