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!)
A065745 Sum of squares and twice squares dividing n. 1
1, 3, 1, 7, 1, 3, 1, 15, 10, 3, 1, 7, 1, 3, 1, 31, 1, 30, 1, 7, 1, 3, 1, 15, 26, 3, 10, 7, 1, 3, 1, 63, 1, 3, 1, 70, 1, 3, 1, 15, 1, 3, 1, 7, 10, 3, 1, 31, 50, 78, 1, 7, 1, 30, 1, 15, 1, 3, 1, 7, 1, 3, 10, 127, 1, 3, 1, 7, 1, 3, 1, 150, 1, 3, 26, 7, 1, 3, 1, 31, 91, 3, 1, 7, 1, 3, 1, 15, 1, 30, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(2^e) = 2^(e+1)-1, a(p^e) = (p^(e+2)-1)/(p-1)/(p+1) for odd p and even e and a(p^e) = (p^(e+1)-1)/(p-1)/(p+1) for odd p and odd e.
From Amiram Eldar, Dec 15 2023: (Start)
Dirichlet g.f.: (1 + 1/2^(s-1)) * zeta(2*s-2) * zeta(s).
Sum_{k=1..n} a(k) ~ c * n^(3/2), where c = ((2+sqrt(2))/6) * zeta(3/2) = 1.4865345575818562471... . (End)
MATHEMATICA
f[2, e_] := 2^(e+1) - 1; f[p_, e_] := If[OddQ[e], (p^(e+1)-1)/(p^2-1), (p^(e+2)-1)/(p^2-1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 13 2020 *)
PROG
(PARI) a(n) = sumdiv(n, d, issquare(d)*d + (1 - d%2)*issquare(d/2)*d) \\ Michel Marcus, Jun 17 2013
CROSSREFS
Sequence in context: A053381 A038712 A354587 * A361438 A268670 A360331
KEYWORD
mult,nonn,easy
AUTHOR
Vladeta Jovovic, Dec 04 2001
EXTENSIONS
More terms from Matthew Conroy, Jan 19 2002
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 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)