In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly...

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...

the union of k ascending runs. The number of permutations of n with k ascents is (by definition) the Eulerian number ⟨ n k ⟩ {\displaystyle \textstyle...

hundred [and] eighty-four) is the natural number following 183 and preceding 185. There are 184 different Eulerian graphs on eight unlabeled vertices, and...

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci...

1/cosh t Eulerian numbers count certain types of permutations. Euler number (physics), the cavitation number in fluid dynamics. Euler number (algebraic...

OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A008517 (Second-order Eulerian triangle T(n, k), 1 <= k <= n)". The On-Line Encyclopedia of Integer Sequences...

have even degree. All Eulerian circuits are also Eulerian paths, but not all Eulerian paths are Eulerian circuits. Euler's work was presented to the St...

A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Equivalently, it is a positive integer that has...

Delannoy number Eulerian number Hypergeometric function List of factorial and binomial topics Macaulay representation of an integer Motzkin number Multiplicities...