login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073837 Sum of primes p satisfying n <= p <= 2n. 11

%I #16 Apr 02 2022 09:34:58

%S 2,5,8,12,12,18,31,24,41,60,60,72,72,59,88,119,119,102,139,120,161,

%T 204,204,228,228,228,281,281,281,311,372,341,341,408,408,479,552,515,

%U 515,594,594,636,636,593,682,682,682,635,732,732,833,936,936,990,1099,1099

%N Sum of primes p satisfying n <= p <= 2n.

%C a(n) = A034387(2*n) - A034387(n-1); a(n) <= A179213(n). [_Reinhard Zumkeller_, Jul 05 2010]

%H T. D. Noe, <a href="/A073837/b073837.txt">Table of n, a(n) for n = 1..10000</a>

%e a(7) = 31 = 7+11+13 (sum of primes between 7 and 14).

%p for n from 1 to 150 do l := 0:for j from n to 2*n do if isprime(j) then l := l+j:fi:od:a[n] := l:od:seq(a[j],j=1..150);

%t Table[Total[Select[Range[n, 2 n], PrimeQ]], {n, 56}] (* _Jayanta Basu_, Aug 12 2013 *)

%o (PARI) a(n)=sum(i=n,2*n,i*isprime(i))

%Y Cf. A073838.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Aug 12 2002

%E More terms from _Sascha Kurz_ and _Benoit Cloitre_, Aug 14 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)