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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193553804
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: AN APPROACH TO PILLAI'S PROBLEM: COINCIDENCES BETWEEN THE NARAYANA'S COWS AND TRIBONACCI SEQUENCES.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Diouf%2C+Sémou%22">Diouf, Sémou</searchLink><relatesTo>1</relatesTo><i> zemathos@hotmail.fr</i><br /><searchLink fieldCode="AR" term="%22Fall%2C+Oumar%22">Fall, Oumar</searchLink><relatesTo>1</relatesTo><i> oumar3.fall@ucad.edu.sn</i><br /><searchLink fieldCode="AR" term="%22Deme%2C+Chérif+Bachir%22">Deme, Chérif Bachir</searchLink><relatesTo>2</relatesTo><i> cherifbachir.deme@uadb.edu.sn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Advances+%26+Applications+in+Discrete+Mathematics%22">Advances & Applications in Discrete Mathematics</searchLink>. Feb2026, Vol. 43 Issue 2, p183-196. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Recursive+sequences+%28Mathematics%29%22">Recursive sequences (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+sequences%22">Mathematical sequences</searchLink><br /><searchLink fieldCode="DE" term="%22Diophantine+equations%22">Diophantine equations</searchLink><br /><searchLink fieldCode="DE" term="%22Fibonacci+sequence%22">Fibonacci sequence</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193553804
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.17654/0974165826013
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 183
    Subjects:
      – SubjectFull: Recursive sequences (Mathematics)
        Type: general
      – SubjectFull: Mathematical sequences
        Type: general
      – SubjectFull: Diophantine equations
        Type: general
      – SubjectFull: Fibonacci sequence
        Type: general
    Titles:
      – TitleFull: AN APPROACH TO PILLAI'S PROBLEM: COINCIDENCES BETWEEN THE NARAYANA'S COWS AND TRIBONACCI SEQUENCES.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Diouf, Sémou
      – PersonEntity:
          Name:
            NameFull: Fall, Oumar
      – PersonEntity:
          Name:
            NameFull: Deme, Chérif Bachir
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 09741658
          Numbering:
            – Type: volume
              Value: 43
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Advances & Applications in Discrete Mathematics
              Type: main
ResultId 1