Key points are not available for this paper at this time.
The aim of this paper is to use elementary methods and the recursive properties of a special sequence to study the computational problem of one kind symmetric sums involving Fubini polynomials and Euler numbers, and give an interesting computational formula for it. At the same time, we also give a recursive calculation method for the general case.
Zhao et al. (Wed,) studied this question.