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!)
A360908 Multiplicative with a(p^e) = 2*e - 1. 7
1, 1, 1, 3, 1, 1, 1, 5, 3, 1, 1, 3, 1, 1, 1, 7, 1, 3, 1, 3, 1, 1, 1, 5, 3, 1, 5, 3, 1, 1, 1, 9, 1, 1, 1, 9, 1, 1, 1, 5, 1, 1, 1, 3, 3, 1, 1, 7, 3, 3, 1, 3, 1, 5, 1, 5, 1, 1, 1, 3, 1, 1, 3, 11, 1, 1, 1, 3, 1, 1, 1, 15, 1, 1, 3, 3, 1, 1, 1, 7, 7, 1, 1, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
Dirichlet g.f.: zeta(s) * Product_{p primes} (1 + 2/(p^s*(p^s-1)).
Sum_{k=1..n} a(k) ~ c*n, where c = Product_{p primes} (1 + 2/(p*(p-1)) = 3.279577150984783607372919498914633983999130708105267540952619534539808381...
a(n) = A361430(n^2). - Amiram Eldar, Feb 11 2024
MATHEMATICA
a[n_] := Times @@ ((2*Last[#] - 1) & /@ FactorInteger[n]); a[1] = 1; Array[a, 100] (* Amiram Eldar, Feb 25 2023 *)
PROG
(PARI) for(n=1, 100, print1(direuler(p=2, n, (1+(1+1/X)/(1-1/X)^2))[n], ", "))
(PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k, 1]=2*f[k, 2]-1; f[k, 2]=1); factorback(f); \\ Michel Marcus, Feb 25 2023
CROSSREFS
Sequence in context: A131268 A109221 A369227 * A351347 A046643 A369180
KEYWORD
nonn,mult
AUTHOR
Vaclav Kotesovec, Feb 25 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 May 29 00:29 EDT 2024. Contains 372921 sequences. (Running on oeis4.)