The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064944 a(n) = Sum_{i|n, j|n, j >= i} j. 3
 1, 5, 7, 17, 11, 38, 15, 49, 34, 60, 23, 132, 27, 82, 82, 129, 35, 191, 39, 207, 112, 126, 47, 384, 86, 148, 142, 283, 59, 469, 63, 321, 172, 192, 172, 666, 75, 214, 202, 597, 83, 640, 87, 435, 403, 258, 95, 1016, 162, 485, 262, 511, 107, 812, 264, 813, 292, 324 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n=1..1000 FORMULA a(n) = Sum_{i=1..tau(n)} i*d_i, where {d_i}, i=1..tau(n) is the increasing sequence of divisors of n. a(n) = Sum_{i=1..A000005(n)} i*A027750(n, i). - Michel Marcus, Jun 10 2015 EXAMPLE a(6) = max(1,1)+max(1,2)+max(1,3)+max(1,6)+max(2,2)+max(2,3)+max(2,6)+max(3,3)+max(3,6)+max(6,6)=38, or a(6) = dot_product(1,2,3,4)*(1,2,3,6)=1*1+2*2+3*3+4*6=38. MAPLE with(numtheory): seq(add(i*sort(convert(divisors(n), 'list'))[i], i=1..tau(n)), n=1..200); PROG (PARI) { for (n=1, 1000, d=divisors(n); a=sum(i=1, length(d), i*d[i]); write("b064944.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 30 2009 (Haskell) a064944 = sum . zipWith (*) [1..] . a027750_row' -- Reinhard Zumkeller, Jul 14 2015 CROSSREFS Cf. A000005, A060640, A064945. Cf. A027750. Sequence in context: A276717 A318491 A060640 * A341038 A070372 A082818 Adjacent sequences:  A064941 A064942 A064943 * A064945 A064946 A064947 KEYWORD nonn AUTHOR Vladeta Jovovic, Oct 28 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 05:11 EDT 2021. Contains 347605 sequences. (Running on oeis4.)