Enumeration of permutations by number of alternating runs

Let R(n,k) denote the number of permutations of {1,2,…,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers R(n,k). Moreover, we establish a connection between alternating runs and Andre permutations.