Further results on staircase graph words

Staircase words are words in which consecutive letters do not differ by more than $1$. We generalize this by extending the restriction to letters lying further apart from each other and obtain the corresponding generating functions, which we express in terms of the Chebyshev polynomials of the second kind.