Abstract
This work presents a combinatorial bijection between the set of lattice paths and the set of ordered trees, both counted by the central coefficients of the expansion of the trinomial (1+x+x^2)^n. Moreover, using a combinatorial interpretation of Catalan numbers, we establish a new set of ordered trees counted by a new sequence.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
