Combinatorial Properties and Values of High-Order Eulerian Numbers

This paper studies higher-order Eulerian numbers based on Stirling permutations and utilizing Eulerian triangles. It primarily focuses on the chain of higher-order Eulerian numbers, higher-order Eulerian polynomials, and higher-order Eulerian fractions, especially their computation. Many results for Eulerian numbers and second-order Eulerian numbers are generalized to higher-order Eulerian numbers. More specifically, we present recurrence relations of high-order Eulerian numbers, row-generating functions, and row sums of higher-order Eulerian triangles. Furthermore, we investigate the higher-order Eulerian fraction and its alternative form. Some properties of higher-order Eulerian fractions are expressed using differentiation and integration. We derive the inversion relations between second-order Eulerian numbers and Stirling numbers of the second and first kinds. Finally, we provide exact expressions and a computational method for higher-order Eulerian numbers.