On the Problem of Pillai with Tribonacci Numbers and Powers of 3
Institute of Analysis and Number Theory
Graz University of Technology
Let (Tn)n ≥ 0
be the sequence of tribonacci numbers defined by
T0 = 0, T1 = T2 = 1,
and Tn+3 =
Tn+2 + Tn+1 + Tn
for all n ≥ 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.
Full version: pdf,
(Concerned with sequence
Received June 1 2019; revised versions received July 31 2019; August 21 2019.
Published in Journal of Integer Sequences,
August 23 2019.
Journal of Integer Sequences home page