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

The Tribonacci sequence {Tn}n≥0 resembles the Fibonacci sequence in that it starts with the values 0, 1, 1, and each term afterwards is the sum of the preceding three terms. In this paper, we find all integers c having at least two representations as a difference between a Tribonacci number and a power of 2. This paper continues the previous work [5].

ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2