In this paper we focus on Dyck paths with peaks avoiding or restricted to an arbitrary set of heights. The generating functions of such types of Dyck paths can be represented by continued fractions. We also discuss a special case that requires all peak heights to either lie on or avoid a congruence class (or classes) modulo k. The case when k = 2 is especially interesting. The two sequences for this case are proved, combinatorially as well as algebraically, to be the Motzkin numbers and the Riordan numbers. We introduce the concept of shift equivalence on sequences, which in turn induces an equivalence relation on avoiding and restricted sets. Several interesting equivalence classes whose representatives are well-known sequences are given as examples.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.