AN APPROACH TO PILLAI'S PROBLEM: COINCIDENCES BETWEEN THE NARAYANA'S COWS AND TRIBONACCI SEQUENCES.

Saved in:
Bibliographic Details
Title: AN APPROACH TO PILLAI'S PROBLEM: COINCIDENCES BETWEEN THE NARAYANA'S COWS AND TRIBONACCI SEQUENCES.
Authors: Diouf, Sémou1 zemathos@hotmail.fr, Fall, Oumar1 oumar3.fall@ucad.edu.sn, Deme, Chérif Bachir2 cherifbachir.deme@uadb.edu.sn
Source: Advances & Applications in Discrete Mathematics. Feb2026, Vol. 43 Issue 2, p183-196. 14p.
Subjects: Recursive sequences (Mathematics), Mathematical sequences, Diophantine equations, Fibonacci sequence
Abstract: The Narayana's cows sequence (Nm)m≥0 and the Tribonacci sequence (Tn)n≥0are respectively the sequences A000930 and A00073 in the OIES system satisfying respectively the recurrence relations: Nm+3 = Nm+2 + Nm for integers m ≥ 0 (1) with initial terms N0 = N1 = N2 = 1 and Tn+3 = Tn+2 + Tn+1 + Tn for integers n ≥ 0 (2) with initial terms T0 = T1 = 0 and T2 = 1. In this paper, our aim is to solve the equation Nm = Tn, where m and n are positive integers [ABSTRACT FROM AUTHOR]
Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:The Narayana's cows sequence (Nm)m≥0 and the Tribonacci sequence (Tn)n≥0are respectively the sequences A000930 and A00073 in the OIES system satisfying respectively the recurrence relations: Nm+3 = Nm+2 + Nm for integers m ≥ 0 (1) with initial terms N0 = N1 = N2 = 1 and Tn+3 = Tn+2 + Tn+1 + Tn for integers n ≥ 0 (2) with initial terms T0 = T1 = 0 and T2 = 1. In this paper, our aim is to solve the equation Nm = Tn, where m and n are positive integers [ABSTRACT FROM AUTHOR]
ISSN:09741658
DOI:10.17654/0974165826013