OFFSET
1,2
COMMENTS
When n is prime, a(n) = n + 1.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
a(4) = 21 because the divisors of 4 are 1, 2 and 4, their cumulative sums are 1, 3 and 7, and 1 * 3 * 7 = 21.
a(5) = 6 because the divisors of 5 are 1 and 5, their cumulative sums are 1 and 6, and 1 * 6 = 6.
MATHEMATICA
Table[Times@@Table[Plus@@Take[Divisors[n], k], {k, DivisorSigma[0, n]}], {n, 44}] (* Alonso del Arte, Oct 14 2011 *)
Table[Times@@Accumulate[Divisors[n]], {n, 50}] (* Harvey P. Dale, Aug 15 2013 *)
PROG
(PARI) a(n)=local(ds, sd); ds=divisors(n); prod(k=1, #ds, sd+=ds[k])
(Haskell)
a197410 = product . scanl1 (+) . a027750_row
-- Reinhard Zumkeller, Jan 26 2013
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
Franklin T. Adams-Watters, Oct 14 2011
STATUS
approved