math.NT — Number Theory
GPF-Tribonacci sequences admit no uniform linear bound
A GPF-Tribonacci sequence is a sequence of primes in which every term is the greatest prime factor of the sum of the three preceding terms. Back and Caragiu asked whether there is a constant such that every term of every such sequence is at most times the largest of its three initial terms. We show that the answer is no. For every we show that there are GPF-Tribonacci sequences, starting from three distinct and arbitrarily large primes, in which three consecutive terms are all larger than times the largest initial term. This happens after steps. In the proof we prescribe the quotient of the sum of three consecutive terms by the next term. These quotients follow the periodic pattern . Then we apply the theorem of Green, Tao and Ziegler on linear equations in primes. The conjecture of Back and Caragiu that every GPF-Tribonacci sequence is ultimately periodic remains open.