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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328667 a(n) = Sum_{d divides n} (-1)^(n + 1 + d + n/d) * d^2. 2
 1, 5, 10, 13, 26, 50, 50, 45, 91, 130, 122, 130, 170, 250, 260, 173, 290, 455, 362, 338, 500, 610, 530, 450, 651, 850, 820, 650, 842, 1300, 962, 685, 1220, 1450, 1300, 1183, 1370, 1810, 1700, 1170, 1682, 2500, 1850, 1586, 2366, 2650, 2210, 1730, 2451, 3255 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 FORMULA Multiplicative with a(2^e) = (2^(2*e+1) + 7)/3 = A321358(e) if e>0, else a(p^e) = (p^(2*e+2) - 1)/(p^2 - 1). G.f.: Sum_{k>=1} k^2 * x^k/(1 + (-x)^k) = Sum_{k>=1} x^k*(1 - (-x)^k)/(1 + (-x)^k)^3. a(n) = -(-1)^n*A321558(n). a(2*n - 1) = A001157(2*n - 1) = A099978(n). a(4*n + 2) = A001157(4*n + 2). Sum_{k=1..n} a(k) ~ c * n^3, where c = 7*zeta(3)/24 = 0.350599... . - Amiram Eldar, Nov 01 2022 EXAMPLE G.f. = x + 5*x^2 + 10*x^3 + 13*x^4 + 26*x^5 + 50*x^6 + 50*x^7 + 45*x^8 + ... MATHEMATICA a[ n_] := If[ n < 1, 0, DivisorSum[n, (-1)^(n + 1 + # + n/#) #^2 &]; PROG (PARI) {a(n) = sumdiv(n, d, (-1)^(n + 1 + n\d + d)*d^2)}; CROSSREFS Cf. A001157, A002117, A099978, A321358, A321558. Sequence in context: A061145 A345261 A321558 * A317966 A119139 A313451 Adjacent sequences: A328664 A328665 A328666 * A328668 A328669 A328670 KEYWORD nonn,mult AUTHOR Michael Somos, Oct 24 2019 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.

Last modified May 21 22:16 EDT 2024. Contains 372741 sequences. (Running on oeis4.)