TOPICS
Search

Euler Zigzag Number


An Euler zigzag number A_n counts the down-up alternating permutations of n objects, with inequalities p_1>p_2<p_3>... and the convention A_0=1. The initial values are 1, 1, 1, 2, 5, 16, 61, ... (OEIS A000111). For a nonnegative integer n,

 A_n=E(n,n),
(1)

where E(n,k) is an Entringer number. For n>=2, including both starting orientations gives 2A_n permutations. For n>=1, the number of permutations of n elements that start with k and then alternate down and up is E(n-1,k-1) for 1<=k<=n.

The Entringer numbers satisfy

 E(n,0)={1   for n=0; 0   for n>=1,
(2)

and the recurrence relation

 E(n,k)=E(n,k-1)+E(n-1,n-k)
(3)

for 1<=k<=n.


See also

Alternating Permutation, Entringer Number, Secant Number, Tangent Number

Explore with Wolfram|Alpha

References

Ruskey, F. "Information of Alternating Permutations." https://web.archive.org/web/20170424224013/http://theory.cs.uvic.ca/inf/perm/Alternating.html.Sloane, N. J. A. Sequence A000111/M1492 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Euler Zigzag Number

Cite this as:

Weisstein, Eric W. "Euler Zigzag Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EulerZigzagNumber.html

Subject classifications