We prove a
linear recursion for the generalized Catalan
numbers
![$C_a(n) := \frac{1}{(a-1)n+1} {an \choose n}$](abs/img1.gif)
when
![$a \geq
2$](abs/img2.gif)
.
As a consequence, we show
![$p \, \vert \, C_p(n)$](abs/img3.gif)
if
and only if
![$n \neq \frac{p^k-1}{p-1}$](abs/img4.gif)
for all integers
![$k \geq 0$](abs/img5.gif)
.
This is a generalization of the well-known result that the usual
Catalan number
![$C_2(n)$](abs/img6.gif)
is odd if and only if
![$n$](abs/img7.gif)
is a Mersenne
number
![$2^k-1$](abs/img8.gif)
. Using certain beautiful results of Kummer and
Legendre, we give a second proof of the divisibility result for
![$C_p(n)$](abs/img9.gif)
. We also give suitably formulated inductive proofs of
Kummer's and Legendre's formulae which are different from the
standard proofs.