Abstract
Let $ (T_{n})_{n\geq 0} $ be the sequence of Tribonacci numbers defined by $ T_0=0 $, $ T_1 = T_2=1$, and $ T_{n+3}=T_{n+2}+ T_{n+1} +T_n$ for all $ n\geq 0 $. In this note, we find all integers $ c $ admitting at least two representations as a difference between a tribonacci number and a power of $ 3 $.
Original language | English |
---|---|
Article number | 19.5.6 |
Pages (from-to) | 1-14 |
Number of pages | 14 |
Journal | Journal of Integer Sequences |
Volume | 22 |
Issue number | 5 |
Publication status | Published - 23 Aug 2019 |
Keywords
- Tribonacci sequence
- Pell equation
- Linear forms in logarithms
- Baker's method
ASJC Scopus subject areas
- Algebra and Number Theory
Fields of Expertise
- Information, Communication & Computing