Eulerian number ($A(n,k)$)

Eulerian numbers, denoted as \( E(n, k) \), are a set of integers that count the number of permutations of \( n \) elements in which exactly \( k \) elements appear in ascents. An ascent in a permutation is a position where the next element is larger than the current one.