|
| |
|
|
A061568
|
|
Number of primes <= sum of first n primes.
|
|
1
| |
|
|
1, 3, 4, 7, 9, 13, 16, 21, 25, 31, 37, 45, 51, 60, 66, 75, 85, 95, 103, 115, 127, 138, 150, 162, 177, 191, 205, 219, 233, 250, 267, 283, 300, 319, 338, 360, 376, 400, 421, 441, 461, 481, 509, 531, 557, 578, 602, 630, 653, 684
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
MATHEMATICA
| PrimePi/@FoldList[Plus, 0, Prime[Range[50]]]//Rest
|
|
|
PROG
| (PARI) { default(primelimit, 3682913); n=0; s=0; forprime (p=2, prime(1000), s+=p; write("b061568.txt", n++, " ", primepi(s)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 24 2009]
|
|
|
CROSSREFS
| Cf. A000849.
Sequence in context: A072441 A152032 A004652 * A146994 A103054 A140208
Adjacent sequences: A061565 A061566 A061567 * A061569 A061570 A061571
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Harvey P. Dale (hpd1(AT)nyu.edu), May 18 2001
|
| |
|
|
