login
This site is supported by donations 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. 2
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

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); (Deutsch)

MATHEMATICA

f[n_] := Plus @@ Prime[ Range[PrimePi[n^2] + 1, PrimePi[(n + 1)^2]]]; Table[ f[n], {n, 44}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 01 2005)

PROG

(PARI) A108314(n)={r=0; forprime(i=n^2+1, (n+1)^2-1, r=r+i); r} [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 14 2009]

CROSSREFS

Cf. A014085

Sequence in context: A188182 A187210 A126880 * A079425 A169699 A109624

Adjacent sequences:  A108311 A108312 A108313 * A108315 A108316 A108317

KEYWORD

easy,nonn

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jun 30 2005

EXTENSIONS

Edited, corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Robert G. Wilson v (rgwv(AT)rgwv.com) and Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jul 01 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.