cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073837 Sum of primes p satisfying n <= p <= 2n.

This page as a plain text file.
%I A073837 #16 Apr 02 2022 09:34:58
%S A073837 2,5,8,12,12,18,31,24,41,60,60,72,72,59,88,119,119,102,139,120,161,
%T A073837 204,204,228,228,228,281,281,281,311,372,341,341,408,408,479,552,515,
%U A073837 515,594,594,636,636,593,682,682,682,635,732,732,833,936,936,990,1099,1099
%N A073837 Sum of primes p satisfying n <= p <= 2n.
%C A073837 a(n) = A034387(2*n) - A034387(n-1); a(n) <= A179213(n). [_Reinhard Zumkeller_, Jul 05 2010]
%H A073837 T. D. Noe, <a href="/A073837/b073837.txt">Table of n, a(n) for n = 1..10000</a>
%e A073837 a(7) = 31 = 7+11+13 (sum of primes between 7 and 14).
%p A073837 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 A073837 Table[Total[Select[Range[n, 2 n], PrimeQ]], {n, 56}] (* _Jayanta Basu_, Aug 12 2013 *)
%o A073837 (PARI) a(n)=sum(i=n,2*n,i*isprime(i))
%Y A073837 Cf. A073838.
%K A073837 nonn
%O A073837 1,1
%A A073837 _Amarnath Murthy_, Aug 12 2002
%E A073837 More terms from _Sascha Kurz_ and _Benoit Cloitre_, Aug 14 2002