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!)
A108314 Sum of primes p with n^2 < p < (n+1)^2. 7
5, 12, 24, 59, 60, 168, 173, 290, 269, 533, 534, 787, 917, 830, 1420, 1901, 1541, 2076, 2288, 2953, 3219, 3533, 3348, 5413, 5208, 4907, 6026, 7343, 6960, 7444, 9948, 9483, 11166, 10749, 12624, 11903, 12713, 17724, 17155, 19590, 18975, 16249, 22702, 21859, 26943 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
EXAMPLE
a(2)=12 because between 4 and 9 there are two primes (5 and 7) with sum equal to 12.
MAPLE
a:=proc(n) local s, j: s:=0: for j from n^2 to (n+1)^2 do if isprime(j)=true then s:=s+j else s:=s: fi od end: seq(a(n), n=1..50); # Emeric Deutsch, Jul 01 2005
MATHEMATICA
f[n_] := Plus @@ Prime[ Range[PrimePi[n^2] + 1, PrimePi[(n + 1)^2]]]; Table[ f[n], {n, 44}] (* Robert G. Wilson v, Jul 01 2005 *)
PROG
(PARI) A108314(n)={r=0; forprime(i=n^2+1, (n+1)^2-1, r=r+i); r} \\ Michael B. Porter, Oct 14 2009
(Python)
from sympy import sieve
def a(n): return sum(p for p in sieve.primerange(n**2, (n+1)**2))
print([a(n) for n in range(1, 46)]) # Michael S. Branicky, Jul 29 2021
CROSSREFS
Sequence in context: A187210 A299901 A126880 * A337065 A079425 A272194
KEYWORD
easy,nonn
AUTHOR
Giovanni Teofilatto, Jun 30 2005
EXTENSIONS
Edited, corrected and extended by Emeric Deutsch, Robert G. Wilson v and Rick L. Shepherd, Jul 01 2005
STATUS
approved

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 August 26 01:13 EDT 2024. Contains 375454 sequences. (Running on oeis4.)