login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A245484
a(n) = Sum_{(d<n)|n} d*sigma(d).
2
0, 1, 1, 7, 1, 19, 1, 35, 13, 37, 1, 119, 1, 63, 43, 155, 1, 208, 1, 245, 69, 139, 1, 575, 31, 189, 130, 427, 1, 661, 1, 651, 145, 313, 87, 1274, 1, 387, 195, 1205, 1, 1155, 1, 959, 520, 559, 1, 2511, 57, 992, 319, 1309, 1, 1990, 163, 2115, 393, 877, 1, 4025
OFFSET
1,4
COMMENTS
If q are proper divisors of n then values of sequence a(n) are the bending moments at point 0 of static forces of sizes sigma(q) operating in places q on the cantilever as the nonnegative number axis of length n with support at point 0 by the schema: a(n) = Sum_{q | n} q*sigma(q).
LINKS
FORMULA
a(n) = A001001(n) - A064987(n) = A064987(n) - A245773(n).
a(n) = 1 for n = primes.
EXAMPLE
For n=21 with proper divisors [1,3,7] we have: a(21) = 7*sigma(7) + 3*sigma(3) + 1*sigma(1) = 7*8 + 3*4 + 1*1 = 69.
MATHEMATICA
a245484[n_Integer] := Total[#*DivisorSigma[1, #] & /@ Most[Divisors[n]]]; a245484 /@ Range[60] (* Michael De Vlieger, Aug 17 2014 *)
PROG
(Magma)[((&+[d*SumOfDivisors(d): d in Divisors(n)])-n*SumOfDivisors(n)): n in [1..1000]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Aug 16 2014
STATUS
approved