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 (permutations with "ascents").
The polynomials presently known as Eulerian polynomials in Euler's work from 1755, Institutiones calculi differentialis, part 2, §173, p. 485/6. The coefficients of these polynomials are known as Eulerian numbers.
Other notations for are and .
Hidden categories:
Articles with short description
Short description is different from Wikidata
Use American English from March 2019
All Wikipedia articles written in American English