Abstract
Eulerian numbers, introduced by Euler in 1736 [5], while not as ubiquitous as the more familiar Bernoulli numbers, Stirling numbers, harmonic numbers, or binomial coefficients, nevertheless arise in a variety of contexts in enumerative combinatorics, for example, in the enumeration of permutations with a given number of descents [7]. Because the recurrence for Eulerian numbers is a bit more complicated than for many other families of special numbers, and because they increase in size rather rapidly, it was stated in [7] that, “We don’t expect the Eulerian numbers to satisfy as many simple identities.” Nevertheless, the following identity is rather elegant and appears to be new.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
