Abstract
We investigate the conditions on an integer sequence f ( n ) , n ∈ N , with f ( 1 ) = 0 , such that the sequence q ( n ) , computed recursively via q ( n ) = q ( n − q ( n − 1 ) ) + f ( n ) , with q ( 1 ) = 1 , exists. We prove that f ( n ) is ‘slow’, that is, f ( n + 1 ) − f ( n ) ∈ { 0 , 1 } , n ≥ 1 , is a sufficient but not necessary condition for the existence of sequence q. Sequences q defined in this way typically display non-trivial dynamics: in particular, they are generally aperiodic with no obvious patterns. We discuss and illustrate this behavior with some examples.
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 callSimilar Papers
Disclaimer: 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.
