Back to Robert's Math Figures

The numbers of alternating permutations (permutations in which the difference between each successive pair of adjacent elements changes sign—that is, each “rise” is followed by a “fall”, and vice versa) for

nelements are sometimes called theEuler zigzag numbers. For the list {1, 2, 3}, the permutation {1, 3, 2} is an alternating permutation, while {3, 2, 1} is not. Determining the number of alternating permutations of the elements {1, 2, …,n} is calledAndré’s Problem.The following examples illustrate only the alternating permutations that begin with a “rise”; we can get all the permutations that begin with a “fall” by flipping the images vertically.

For the list {1, 2, 3}, there are 2 alternating permutations.

For {1, 2, 3, 4}, there are 5 alternating permutations.

For {1, 2, 3, 4, 5}, there are 16 alternating permutations.

For {1, 2, 3, 4, 5, 6}, there are 61 alternating permutations.

For {1, 2, 3, 4, 5, 6, 7}, there are 272 alternating permutations.

Suggestion Box || Home || The Math Library || Help Desk || Quick Reference || Search