Counting up-up-or-down-down permutations

Abstract

Answering a question of Donald Knuth, we find the bivariate exponential generating function for "up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1{a}_2\cdots a_n$ satisfying $a_{2i-1}<a_{2i}$ if and only if $a_{2i}<a_{2i+1}$ for $1\le i<n/2$. Equivalently, an up-up-or-down-down permutation is one in which every peak and every valley is odd.