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

Let $ (N_n)_{n\ge 0}$ be the Narayana's cow sequence defined by a third-orderrecurrence relation $ N_0=0,\ N_1= N_2=1 $, and $ N_{n+3}=N_{n+2}+N_n $ for all$ n\ge 0 $. In this paper, we determine all Narayana numbers that areconcatenations of two repdigits. The proof of our main theorem uses lowerbounds for linear forms in logarithms and a version of the Baker-Davenportreduction method in Diophantine approximation.

Members of Narayana's cow sequence that are concatenations of two repdigits