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.
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!)
A359949 Multiplicative sequence with a(p) = 3*p-1 and a(p^e) = (3*e*(p-1) + 3) * p^(e-1) for e > 1 and prime p. 0
1, 5, 8, 18, 14, 40, 20, 48, 45, 70, 32, 144, 38, 100, 112, 120, 50, 225, 56, 252, 160, 160, 68, 384, 135, 190, 189, 360, 86, 560, 92, 288, 256, 250, 280, 810, 110, 280, 304, 672, 122, 800, 128, 576, 630, 340, 140, 960, 273, 675, 400, 684, 158, 945, 448, 960, 448, 430, 176, 2016 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Dirichlet g.f.: zeta(s-1)^3 / (zeta(s) * zeta(3*s-3)).
Dirichlet convolution of A000010(n) and n * A073184(n).
a(n) = Sum_{k=1..n} gcd(k, n) * A073184(gcd(k, n)).
MATHEMATICA
f[p_, e_] := If[e == 1, 3*p - 1, (3*e*(p - 1) + 3)*p^(e - 1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Jan 19 2023 *)
PROG
(PARI) a(n) = my(f=factor(n), p, e); for (k=1, #f~, p=f[k, 1]; e=f[k, 2]; f[k, 1] = if (e == 1, 3*p-1, (3*e*(p-1) + 3) * p^(e-1)); f[k, 2] = 1); factorback(f); \\ Michel Marcus, Jan 21 2023
CROSSREFS
Sequence in context: A280251 A104321 A196934 * A291752 A237276 A155086
KEYWORD
nonn,easy,mult
AUTHOR
Werner Schulte, Jan 19 2023
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 June 5 23:50 EDT 2024. Contains 373110 sequences. (Running on oeis4.)