We study the distribution of the last symbol statistics on the sets of Catalan words avoiding a consecutive pattern of length at most three. For each pattern p , we provide a bivariate generating function, where the coefficient c p ( n,k ) of x n y k in its series expansion is the number of length n Catalan words avoiding p and ending with the symbol k . We deduce recurrence relations or closed forms for c p ( n , k ) and we provide asymptotic approximations for the expectation of the last symbol on all Catalan words avoiding p . Finally, we characterize the sequence c p ( n , k ) using Riordan arrays.