We give a combinatorial proof of a known sum concerning the product of a binomial coefficient with two central binomial coefficients. The method of description, involution, and exception is used. The same combinatorial argument also proves the "-1 shifted version" of this sum. As a consequence, two new binomial coefficient identities with the Catalan numbers are derived.