OFFSET
1,2
COMMENTS
Sequence is not the same as A007429: a(66) = 248, A007429(66) = 260. Number 66 is the smallest number with at least two divisors d with the same sigma(d); see A206030.
In A007429 all values of sigma(d) of the divisors d of n are included in the sum with repetitions allowed. In this sequence only the distinct values of sigma(d) of the divisors d of n are included in the sum.
If a term is a prime p when n = 2^j then p = 2^(j+2)-(j+3) is also a term of A099440 (primes of the form 2^n-n-1). Greater of twin primes are terms. - Metin Sariyar, Apr 03 2020
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..10000
FORMULA
EXAMPLE
For n=6 -> divisors d of 6: 1,2,3,6; corresponding values of sigma(d): 1,3,4,12; a(6) = Sum of k = 1+3+4+12 = 20.
For n=66 -> divisors d of 66: 1,2,3,6,11,22,33,66; corresponding values of sigma(d): 1,3,4,12,12,36,48,144; a(66) = Sum of k = 1+3+4+12+36+48+144 = 248 (note that only one twelve is added.).
MATHEMATICA
Table[Total[Union[DivisorSigma[1, Divisors[n]]]], {n, 100}] (* T. D. Noe, Feb 10 2012 *)
PROG
(PARI) a(n)={vecsum(Set(apply(sigma, divisors(n))))} \\ Andrew Howroyd, Aug 01 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Feb 03 2012
EXTENSIONS
Name clarified by David A. Corneth, Aug 01 2018
a(62)-a(66) from Andrew Howroyd, Aug 01 2018
STATUS
approved