|
Search: id:A133760
|
|
|
| A133760 |
|
Sum of the divisors of the composite numbers between prime(n) and prime(n+1). |
|
+0
1
|
|
| 0, 3, 4, 11, 6, 13, 6, 14, 25, 8, 27, 16, 8, 16, 29, 28, 12, 29, 18, 12, 28, 19, 32, 46, 21, 8, 20, 12, 22, 81, 20, 36, 8, 59, 12, 38, 34, 18, 39, 32, 18, 58, 14, 21, 12, 80, 70, 25, 12, 24, 34, 20, 56, 43, 34, 38, 16, 40, 26, 8, 65, 96, 24, 16, 22, 99, 40, 62, 12, 32, 30, 61, 40, 44
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) = sum_{ prime(n)<i<prime(n+1)} A000005(i).
|
|
EXAMPLE
|
a(1) = 0 because there is no composite number between the primes 2 and 3.
a(4)= 11 = A000005(8)+A000005(9)+A000005(10), indices delimited by prime(4) = 7 and prime(5) = 11.
|
|
MAPLE
|
A000005 := proc(n) numtheory[tau](n) ; end: A133760 := proc(n) add( A000005(i), i=ithprime(n)+1..ithprime(n+1)-1) ; end: seq(A133760(n), n=1..80);
|
|
MATHEMATICA
|
f[n_] := Plus @@ Flatten@ DivisorSigma[0, { Range[ Prime[n] + 1, Prime[n + 1] - 1]}]; Array[f, 74] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A000005.
Adjacent sequences: A133757 A133758 A133759 this_sequence A133761 A133762 A133763
Sequence in context: A143108 A014009 A085386 this_sequence A056045 A096223 A047457
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 05 2008
|
|
EXTENSIONS
|
Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com) and R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 06 2008
|
|
|
Search completed in 0.002 seconds
|
