[seqfan] Re: Sum of primes - 10^9 increment

[Dmitry Kamenetsky]

I think that sequence is a more granular version of A046731. I guess its
useful for computing pi(x), but personally I don't find it very interesting.

Dmitry

"Jacques Tramu" <jacques.tramu at echolalie.com> wrote:
> Hi SeqFans,
> Let sp(n) = Sum of primes <=n
> 
> For some reason (Carlos Rivera), I had to build and record the sequence :
> 
> a[i] = sp(i * 10^9)    i=1,..,1000
> 
> a[1] = 24739512092254535 
> ...
> a[10] = 2220822432581729238
> ...
> a[1000] = 18435588552550705911377
> 
> Is this sequence of any interest to the OEIS ?
> 
> See also A046731
> 
> -------------------------------------
> http://www.echolalie.com/gbnums
> -------------------------------------
> 
> 
> 
> _______________________________________________
> 
> Seqfan Mailing list - http://list.seqfan.eu/
>