The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332844 Dirichlet g.f.: zeta(s) * zeta(s-1) * zeta(2*s). 2
 1, 3, 4, 8, 6, 12, 8, 18, 14, 18, 12, 32, 14, 24, 24, 39, 18, 42, 20, 48, 32, 36, 24, 72, 32, 42, 44, 64, 30, 72, 32, 81, 48, 54, 48, 112, 38, 60, 56, 108, 42, 96, 44, 96, 84, 72, 48, 156, 58, 96, 72, 112, 54, 132, 72, 144, 80, 90, 60, 192, 62, 96, 112, 166, 84 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 FORMULA G.f.: Sum_{k>=1} sigma(k) * (theta_3(x^k) - 1) / 2. a(n) = Sum_{d|n} A076752(d). a(n) = Sum_{d|n} A206369(n/d) * tau(d). a(n) = Sum_{d|n} A010052(n/d) * sigma(d). a(n) = Sum_{d|n} A124315(n/d) * phi(d). a(n) = Sum_{d|n} A046951(n/d) * d. a(p) = p + 1, where p is prime. Sum_{k=1..n} a(k) ~ Pi^6 * n^2 / 1080. - Vaclav Kotesovec, Feb 26 2020 MATHEMATICA Table[Sum[Boole[IntegerQ[(n/d)^(1/2)]] DivisorSigma[1, d], {d, Divisors[n]}], {n, 1, 65}] nmax = 65; CoefficientList[Series[Sum[DivisorSigma[1, k] (EllipticTheta[3, 0, x^k] - 1)/2, {k, 1, nmax}], {x, 0, nmax}], x] // Rest PROG (PARI) A332844(n) = sumdiv(n, d, issquare(n/d) * sigma(d)); \\ Antti Karttunen, May 23 2021 CROSSREFS Cf. A000005, A000010, A000203, A010052, A046951, A076752, A124315, A206369, A344442. Sequence in context: A074212 A125715 A129283 * A330575 A079787 A081307 Adjacent sequences:  A332841 A332842 A332843 * A332845 A332846 A332847 KEYWORD nonn,mult AUTHOR Ilya Gutkovskiy, Feb 26 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 16:01 EDT 2021. Contains 345144 sequences. (Running on oeis4.)