Abstract
In this paper, we discuss numbers of downwards and upwards in generalized paper folding sequences. We compute the exact number of downwards and upwards in <TEX>$R^n_p$</TEX> and <TEX>$(R_pR_q)^n$</TEX> by using the properties of recursive sequences where n, p and q are natural numbers with <TEX>$p{\geq}2$</TEX> and <TEX>$q{\geq}2$</TEX>.
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.
