|
Search: id:A108314
|
|
|
| A108314 |
|
Sum of primes p with n^2 < p < (n+1)^2. |
|
+0
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; listen)
|
|
|
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)
|
|
PROGRAM
|
(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: A100479 A018806 A126880 this_sequence A079425 A109624 A081501
Adjacent sequences: A108311 A108312 A108313 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
