OFFSET
1,2
COMMENTS
For all n (except for n = 2) gcd(A008332(n), prime(n)) = 1. - Lechoslaw Ratajczak, Aug 22 2018
REFERENCES
József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Chapter III, p. 87.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Vincenzo Librandi)
William A. Webb, An asymptotic estimate for a class of divisor sums, Duke Math. J., Vol. 38, No. 3 (1971), pp. 575-582.
FORMULA
Sum_{k; prime(k)<=x} a(k) ~ c * x^2/(2*log(x)), where c = A065484 (Webb, 1971). - Amiram Eldar, Mar 04 2021 [corrected Jul 20 2025]
MAPLE
for i from 1 to 500 do if isprime(i) then print(sigma(i-1)); fi; od;
MATHEMATICA
Table[DivisorSigma[1, Prime[n] - 1], {n, 80}] (* Vincenzo Librandi, Aug 20 2018 *)
PROG
(PARI) a(n) = sigma(prime(n)-1); \\ Michel Marcus, Aug 19 2018
(Magma) [DivisorSigma(1, NthPrime(n)-1): n in [1..60]]; // Vincenzo Librandi, Aug 20 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Offset corrected by Michel Marcus, Aug 20 2018
STATUS
approved
