A variant of Touchard's Catalan number identity
arXiv:1204.5704
Abstract
It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a combinatorial interpretation of the identity C_n =sum_{1<=k<=n/2} 2^{n-2k} n-choose-2k C_k (k(n+2))/(n(n-1)), and illustrating its connection with Touchard's identity.
5 pages, minor changes, Added in Proof addendum, Acknowledgement of priority