# COUNTING PROBLEMS IN GENERALIZED PAPER FOLDING SEQUENCES

• Accepted : 2012.08.27
• Published : 2012.09.25

#### 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 $R^n_p$ and $(R_pR_q)^n$ by using the properties of recursive sequences where n, p and q are natural numbers with $p{\geq}2$ and $q{\geq}2$.

#### References

1. Jean-Paul Allouche, The number of factors in a paperfolding sequence, Bull. Austral. Math. Soc., 46 (1992), 23-32. https://doi.org/10.1017/S0004972700011655
2. Bruce Bates, Martin Bunder and Keith Tognetti, Mirroring and interleaving in the paperfolding sequence, Appl. Anal. Discrete Math., 4 (2010), 96-118. https://doi.org/10.2298/AADM1000005B
3. Chandler Davis and Donald E. Knuth, Number representations and dragon curves, J. Rec. Math., 3 (1970), 66-81.
4. Michel Dekking, Paperfolding, morphisms, planefilling, curves and fractal tiles, Theor. Comput. Sci., 414(1) (2012), 20-37 https://doi.org/10.1016/j.tcs.2011.09.025
5. M. Mendes France and A. J. Van Der Poorten, Arithmetic and analytic properties of paper folding sequences, Bull. Austral. Math. Soc. 24(1981), 123-131. https://doi.org/10.1017/S0004972700007486
6. Sunggye Lee, Jinsoo Kim and Won Choi, Relation between folding and unfolding paper of rectangle and (0,1)-pattern, J. Korean Soc. Math. Ed. Ser. E, 23(3)(2009), 507-522.

#### Cited by

1. CLASSIFICATION OF GENERALIZED PAPER FOLDING SEQUENCES vol.35, pp.3, 2013, https://doi.org/10.5831/HMJ.2013.35.3.395