Escape from Geometric Lock-in in GCD-Augmented Fibonacci Recurrences
We study the recurrence C(n)=C(n-1)+C(n-2)+gcd(C(n-1),C(n-2)) through its states, the coprime pairs obtained by dividing consecutive terms by their gcd. A step is an amplification when this gcd grows, and once the states reach a cycle the sequence grows exactly geometrically. The author’s earlier work left open whether...