Hi, folks. Just wanted to inform you all of a little thing I have computed:
a=7*13*37*83, b=17*19*89, c=11*79*101, d=23*29*67*103, e=47*61*107 and f=41*53*109.
Uniquely, it is the last of 30 primes beginning with 7=1+1+1+1+1+1+1 produced by sequentially multiplying all but one addend by the primes from 2 through 109.
The sequential build-up can be obtained from 485191936591420718030369 (just the smallest of 62 primes that work) by looking at the number's base-7 representation and taking the digits by order of increasing significance as the addend not to be multiplied by a prime (Digit equal to 0 means the 1st addend is skipped and the rest multiplied by the prime, etc., with the units digit corresponding to the prime 2).
P.S. Note that with the strict requirement that a term composed of one 1 and the rest of the addends 2 be prime would make the start of any larger analogous sequence start with at least 19. I doubt such a maximal sequence can be found for so large a start, but I will try to see if I am wrong.
[Non-text portions of this message have been removed]