The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A337297 Sum of the coordinates of all pairs of divisors of n, (d1,d2), such that d1 < d2. 0
0, 3, 4, 14, 6, 36, 8, 45, 26, 54, 12, 140, 14, 72, 72, 124, 18, 195, 20, 210, 96, 108, 24, 420, 62, 126, 120, 280, 30, 504, 32, 315, 144, 162, 144, 728, 38, 180, 168, 630, 42, 672, 44, 420, 390, 216, 48, 1116, 114, 465, 216, 490, 54, 840, 216, 840, 240, 270, 60, 1848, 62, 288 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If n = p where p is prime, the only pair of divisors of p such that d1 < d2 is (1,p), whose coordinate sum is a(p) = p + 1. - Wesley Ivan Hurt, May 21 2021
LINKS
FORMULA
a(n) = Sum_{d1|n, d2|n, d1<d2} (d1+d2).
EXAMPLE
a(3) = 4; The divisors of 3 are {1,3}. If we form all ordered pairs (d1,d2) such that d1 < d2, we have: (1,3). The sum of the coordinates gives 1+3 = 4.
a(4) = 14; The divisors of 4 are {1,2,4}. If we form all ordered pairs (d1,d2) such that d1<d2, we have: (1,2), (1,4), (2,4). The sum of all the coordinates gives 1+2+1+4+2+4 = 14.
MATHEMATICA
Table[Sum[Sum[(i + k)*(1 - Ceiling[n/k] + Floor[n/k]) (1 - Ceiling[n/i] + Floor[n/i]), {i, k - 1}], {k, n}], {n, 100}]
PROG
(PARI) a(n) = my(d = divisors(n)); sum(i=1, #d, sum(j=1, i-1, d[i]+d[j])); \\ Michel Marcus, Aug 22 2020
CROSSREFS
Sequence in context: A216868 A082732 A307893 * A220846 A009286 A076663
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Aug 21 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 06:27 EDT 2024. Contains 373144 sequences. (Running on oeis4.)