Pascal Triangle and Restricted Words

Abstract: We continue to investigate combinatorial properties of functions

f_{m}

and

c_{m}

considered in our previous papers. They depend on an initial arithmetic function

f_{0}

. In this paper, the values of

f_{0}

are the binomial coefficients. We first consider the case when the values of

f_{0}

are the binomial coefficients from a row of the Pascal triangle. The values of

f_{0}

consider next are the binomial coefficients from a diagonal of the Pascal triangle. In two final cases, the values of

f_{0}

are the central binomial coefficients and its adjacent neighbors. In each case, we derive an explicit formula for

c_{1} (n, k)

and give its interpretation in terms of restricted words. In the first two cases, we also consider the functions

f_{m}

and

c_{m}

, for

(m > 0)

.

This page was built for publication: Pascal Triangle and Restricted Words