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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We present a natural, combinatorial problem whose solution is given by themeta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$,where $p$ is prime. This combinatorial problem is less general than those givenin [3] (B. Jackson, F. Ruskey, 2006) and [4] (F. Ruskey, C. Deugau, 2009), butit has the advantage of having a simpler statement.

A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation