|
| |
|
|
A139390
|
|
Sum of primes <= 3^n.
|
|
0
| |
|
|
0, 5, 17, 100, 791, 5830, 42468, 327198, 327198, 2575838, 20476640, 166554645, 1353822880, 11150031169, 92258920888, 769310640408, 6447635236133, 54292816788848, 459112338326268, 3896226837717653, 33172345145637461
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| For large n, these numbers can be closely approximated by the number of
primes < (3^n)^2. For example, the sum of primes < 3^12 = 11150031169. The
number of primes < (3^12)^2 = 3^24 = 11152818693. The error here 0.000250.
The second term, 5 is the addition of the primes 2 and 3 since we defined the
sequence as less than or equal.
|
|
|
LINKS
| Cino Hilliard, Sum of Primes.
Cino Hilliard, Sumprimesgmp program.
|
|
|
CROSSREFS
| Cf A057958.
Sequence in context: A203116 A198090 A180382 * A145824 A076516 A145986
Adjacent sequences: A139387 A139388 A139389 * A139391 A139392 A139393
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Cino Hilliard (Hillcino368(AT)hotmail.com), Jun 09 2008
|
| |
|
|
