Abstract
For every integer j⩾1, we define a class of permutations in terms of certain forbidden subsequences. For j=1, the corresponding permutations are counted by the Motzkin numbers, and for j=∞ (defined in the text), they are counted by the Catalan numbers. Each value of j>1 gives rise to a counting sequence that lies between the Motzkin and the Catalan numbers. We compute the generating function associated to these permutations according to several parameters. For every j⩾1, we show that only this generating function is algebraic according to the length of the permutations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
