|
Search: id:A113633
|
|
|
| A113633 |
|
Sum of the first 5^n primes. |
|
+0
1
|
|
| 2, 28, 1060, 39612, 1336090, 42157238, 1271530648, 37178373556, 1062895088910, 29878892909030, 828999068943506, 22762324818835316, 619715756464336328, 16753554900339748756, 450233110894196298638
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The next term, a(15), will require a list of the first 31 * 10^9 primes. This would require a 250 gig file of 31 * 10^9 8-byte primes. Based on the following timing for n=8 to 14 on a P4 2.53 ghz n 8 9 10 11 12 13 14 sec 0.06,0.13,0.63,7.5,64.6,375.38,2092.56 The program in the link will sum the first 5^15 primes in 3.5 hours.
|
|
LINKS
|
C. Hilliard, SumPrimes.
|
|
EXAMPLE
|
The first 5^1 primes add up to 28.
|
|
MATHEMATICA
|
t = {}; c = 1; k = 3; s = 2; Do[ While[c < 5^n, If[PrimeQ[k], c++; s += k]; k += 2]; Print@s; AppendTo[t, s], {n, 0, 10}]; t (from Robert G. Wilson v (rgwv(at)rgwv.com), Jan 17 2006)
|
|
CROSSREFS
|
Sequence in context: A012756 A009403 A026944 this_sequence A009674 A143598 A071220
Adjacent sequences: A113630 A113631 A113632 this_sequence A113634 A113635 A113636
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jan 15 2006
|
|
|
Search completed in 0.002 seconds
|
