Multiple sums of the Szasz sequence

This study introduces a generalization of the multiple sums of the Szasz sequence dependent upon parameter s > – 1/2 and then introduced the m-th order for the moment. Next, proceed to the convergence theorem for this sequence in the ordinary approximation. The Voronovaskaja-type asymptotic formula and an estimate of the error occurring by this approximation. Additionally, a numerical example of this sequence is introduced by choosing a test function and approximating these sequences for different values of the parameters r and s. A numerical compersion between these approximations is done by using the graphs of the sequences with the test function. The triple Szasz sequence is best than the classical Szasz sequence, and when s, r are increased, the generalization actually grew more accurate and approximative