I was trying to compute $$\sum_{k=0}^{n} \left(-\frac{1}{2}\right)^k \, \binom{2k}{k} \, \frac{k}{k+1} = \sum_{k=0}^n \left(-\frac12\right)^k k C_k$$
(where $C_k$ is the $k^{\rm th}$ Catalan number) but could not come up with a good idea. I found out it is equal to $$\sum_{k=0}^{n} \left(-\frac{1}{2}\right)^k \, \binom{2k}{k+1}.$$ Doing some computation I see it is also equal to $$\sum_{k=0}^{n} \left(\frac{1}{2}\right)^k \, \binom{-k-1}{k}.$$ If someone can help, I would be very greatful. Thanks... My attempts might be wrong.
Using Gosper's algorithm, you can prove that your summation does not have any hypergeometric closed form. Roughly, this means that the summation cannot be expressed as a rational function whose numerator and denominator are a product of polynomials in $n$, factorials (more generally, $\Gamma(an+b)$, for complex constants $a$ and $b$), and constants to the $n^{th}$ power. This includes anything involving binomial coefficients.
Technically, this does not rule out closed forms involving expressions like $n^n$, or Stirling numbers, but I suspect there really is no "nice" closed form.
This Maxima code outputs
NO_HYP_SOL, which confirms my claim. Try it online!