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!)
A351315 Sum of the 9th powers of the square divisors of n. 11
1, 1, 1, 262145, 1, 1, 1, 262145, 387420490, 1, 1, 262145, 1, 1, 1, 68719738881, 1, 387420490, 1, 262145, 1, 1, 1, 262145, 3814697265626, 1, 387420490, 262145, 1, 1, 1, 68719738881, 1, 1, 1, 101560344351050, 1, 1, 1, 262145, 1, 1, 1, 262145, 387420490, 1, 1, 68719738881 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = Sum_{d^2|n} (d^2)^9.
Multiplicative with a(p) = (p^(18*(1+floor(e/2))) - 1)/(p^18 - 1). - Amiram Eldar, Feb 07 2022
From Amiram Eldar, Sep 20 2023: (Start)
Dirichlet g.f.: zeta(s) * zeta(2*s-18).
Sum_{k=1..n} a(k) ~ (zeta(19/2)/19) * n^(19/2). (End)
EXAMPLE
a(16) = 68719738881; a(16) = Sum_{d^2|16} (d^2)^9 = (1^2)^9 + (2^2)^9 + (4^2)^9 = 68719738881.
MATHEMATICA
f[p_, e_] := (p^(18*(1 + Floor[e/2])) - 1)/(p^18 - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Feb 07 2022 *)
CROSSREFS
Sum of the k-th powers of the square divisors of n for k=0..10: A046951 (k=0), A035316 (k=1), A351307 (k=2), A351308 (k=3), A351309 (k=4), A351310 (k=5), A351311 (k=6), A351313 (k=7), A351314 (k=8), this sequence (k=9), A351316 (k=10).
Sequence in context: A017445 A017577 A051441 * A352984 A017699 A013966
KEYWORD
nonn,easy,mult
AUTHOR
Wesley Ivan Hurt, Feb 06 2022
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 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)