Fuss-Catalan Triangles

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $\frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an explicit formula counting simple lattice paths). Moreover, for some small values of $p$, the signed sums turn out to be known sequences. \end{abstract}