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!)
A346880 Sum of the divisors, except the smallest and the largest, of the n-th positive even number. 6
0, 2, 5, 6, 7, 15, 9, 14, 20, 21, 13, 35, 15, 27, 41, 30, 19, 54, 21, 49, 53, 39, 25, 75, 42, 45, 65, 63, 31, 107, 33, 62, 77, 57, 73, 122, 39, 63, 89, 105, 43, 139, 45, 91, 143, 75, 49, 155, 72, 116, 113, 105, 55, 171, 105, 135, 125, 93, 61, 239, 63, 99, 185, 126, 121 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) has a symmetric representation.
LINKS
FORMULA
a(n) = A048050(2*n).
Sum_{k=1..n} a(k) = (5*Pi^2/24 - 1) * n^2 + O(n*log(n)). - Amiram Eldar, Mar 21 2024
EXAMPLE
For n = 5 the 5th even number is 10 and the divisors of 10 are [1, 2, 5, 10] and the sum of the divisors of 10 except the smaller and the largest is 2 + 5 = 7, so a(5) = 7.
MATHEMATICA
a[n_] := DivisorSigma[1, 2*n] - 2*n - 1; Array[a, 100] (* Amiram Eldar, Aug 19 2021 *)
PROG
(Python)
from sympy import divisors
def a(n): return sum(divisors(2*n)[1:-1])
print([a(n) for n in range(1, 66)]) # Michael S. Branicky, Aug 19 2021
CROSSREFS
Bisection of A048050.
Partial sums give A346870.
Sequence in context: A244314 A014489 A286270 * A344865 A350130 A033959
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Aug 18 2021
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 April 19 14:04 EDT 2024. Contains 371792 sequences. (Running on oeis4.)