A combinatorial proof of Shapiroʼs Catalan convolution

Shapiro proved an elegant convolution formula involving Catalan numbers of even index. This paper gives a combinatorial proof of his formula. In addition, we show that it is equivalent to an alternating convolution formula of central binomial coefficients.