  The $n$-th rencontres number with the parameter $r$ is the number of
permutations having exactly $r$ fixed points. In particular, a derangement is a
permutation without any fixed point. We presents a short combinatorial proof
for a weighted sum derangement identities.
