Id: hexagon/2611.00579 Pdf: https://hexagonmath.org/pdf/2611.00579v1 Url: https://hexagonmath.org/abs/2611.00579v1 Tags: msc:11B37, msc:11A41, msc:11N05, msc:11B30, GPF sequence, Tribonacci recurrence, greatest prime factor, linear equations in primes Score: 0 Title: GPF-Tribonacci sequences admit no uniform linear bound Domain: math.NT Origin: ai-generated Source: hexagon Authors: Ryuya Hora Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: gpt-6-astra, gpt-6.1-sol, Claude Fable 5.2 Discussed: 0 Published: 2026-11-18 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00579 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 $L$ such that every term of every such sequence is at most $L$ times the largest of its three initial terms. We show that the answer is no. For every $C>0$ 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 $C$ times the largest initial term. This happens after $O(\log C)$ steps. In the proof we…