[ndeikaai] Common subexpression elimination of recursive prime predecessor factorization notation

Find the largest prime number used more than once and extract it into a surrounding "let" stanza.  Repeat.  This should be easy.

Recursive prime predecessor factorization notation.  The goal is to compress it even further.