English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We investigate the conditions on an integer sequence f(n), n 2 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 + 1) - f(n) in {0,1}, n > 0,is a sufficient but not necessary condition for the existence of sequence q.Sequences q defined in this way typically display non-trivial dynamics: inparticular, they are generally aperiodic with no obvious patterns. We discussand illustrate this behaviour with some examples.

A diluted version of the problem of the existence of the Hofstadter sequence