A combinatorial interpretation of the Catalan transform of the Catalan numbers
Abstract
The Catalan transform of a sequence (an)n>=0 is the sequence (bn)n>=0 with bn = Sum[k/(2n-k) (2n-k)-choose-(n-k) ak,k=0..n]. Here we show that the Catalan transform of the Catalan numbers has a simple interpretation: it counts functions f:[1,n] -> [1,n] satisfying the condition that, for all i<j, f(j)-(j-i) is not in the interval [1,f(i)-1].
0