Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064946
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064946 Sum_{i|n, j|n, j>i} j. +0
1
0, 2, 3, 10, 5, 26, 7, 34, 21, 42, 11, 104, 13, 58, 58, 98, 17, 152, 19, 165, 80, 90, 23, 324, 55, 106, 102, 227, 29, 397, 31, 258, 124, 138, 124, 575, 37, 154, 146, 507, 41, 544, 43, 351, 325, 186, 47, 892, 105, 392, 190, 413, 53, 692, 192, 693, 212, 234, 59 (list; graph; listen)
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-1)*d_i, where {d_i}, i=1..tau(n), is increasing sequence of divisors of n.

EXAMPLE

a(6) = dot_product(0,1,2,3)*(1,2,3,6)=0*1+1*2+2*3+3*6=26.

MAPLE

with(numtheory): seq(add((i-1)*sort(convert(divisors(n), 'list'))[i], i=1..tau(n)), n=1..200);

PROGRAM

(PARI) { for (n=1, 1000, d=divisors(n); a=sum(i=2, length(d), (i - 1)*d[i]); write("b064946.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 01 2009]

CROSSREFS

Cf. A000005, A000203.

Adjacent sequences: A064943 A064944 A064945 this_sequence A064947 A064948 A064949

Sequence in context: A048985 A112417 A139693 this_sequence A078730 A163767 A128531

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 28 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research