In combinatorics, the Eulerian number is the number of permutations of the numbers 1 to in which exactly elements are greater than the previous element. Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones... Wikipedia