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!)
A347991 a(n) = Sum_{d|n} 2^(sigma(d) - 1). 4
1, 5, 9, 69, 33, 2061, 129, 16453, 4105, 131109, 2049, 134219853, 8193, 8388741, 8388649, 1073758277, 131073, 274877913101, 524289, 2199023386725, 2147483785, 34359740421, 8388609, 576460752437659725, 1073741857, 2199023263749, 549755817993, 36028797027352773, 536870913, 2361183241434831128621 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = 1 + 2^p.
G.f.: Sum_{k>=1} 2^(sigma(k) - 1) * x^k/(1 - x^k).
MATHEMATICA
a[n_] := DivisorSum[n, 2^(DivisorSigma[1, #] - 1) &]; Array[a, 30] (* Amiram Eldar, Oct 08 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, 2^(sigma(d)-1));
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, 2^(sigma(k)-1)*x^k/(1-x^k)))
CROSSREFS
Sequence in context: A222698 A200440 A370613 * A179100 A358966 A304538
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Oct 08 2021
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 13 17:32 EDT 2024. Contains 373391 sequences. (Running on oeis4.)