The way this is constructed is interesting, but it doesn't appear that a real sequence to generate primes is required, just a list of them:<p>D=0<p>SUM=0<p>for n:<p><pre><code> D += num_digits(PRIME[N]) // +1 for a nice single 0 between them
SUM += PRIME[n]/(10^D)
print fraction(SUM)</code></pre>