The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A320780 Inverse Euler transform of the sum-of-divisors or sigma function A000203. 11
 1, 2, 1, 0, -3, 1, -1, 1, 3, -5, -1, 4, 3, -3, -7, 8, 1, -9, 7, 8, -13, -12, 27, 7, -19, -14, 11, -17, -25, 198, -81, -312, 89, 326, 325, -739, -275, 572, -255, 1287, -453, -2062, -583, 2155, 5985, -6725, -6661, 6968, 3045, 3876, -7205, -2773, -5447, -4902 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The Euler transform of a sequence q is the sequence of coefficients of x^n, n > 0, in the expansion of Product_{n > 0} 1/(1 - x^n)^q(n). LINKS Table of n, a(n) for n=1..54. OEIS Wiki, Euler transform MAPLE # The function EulerInvTransform is defined in A358451. a := EulerInvTransform(n -> ifelse(n=0, 1, NumberTheory:-SumOfDivisors(n, 1))): seq(a(n), n = 1..54); # Peter Luschny, Nov 21 2022 MATHEMATICA EulerInvTransform[{}]={}; EulerInvTransform[seq_]:=Module[{final={}}, For[i=1, i<=Length[seq], i++, AppendTo[final, i*seq[[i]]-Sum[final[[d]]*seq[[i-d]], {d, i-1}]]]; Table[Sum[MoebiusMu[i/d]*final[[d]], {d, Divisors[i]}]/i, {i, Length[seq]}]]; EulerInvTransform[Table[DivisorSigma[1, n], {n, 30}]] CROSSREFS Cf. A000203. Sequence in context: A335435 A363048 A262114 * A029312 A287352 A243715 Adjacent sequences: A320777 A320778 A320779 * A320781 A320782 A320783 KEYWORD sign AUTHOR Gus Wiseman, Oct 22 2018 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.

Last modified February 21 03:52 EST 2024. Contains 370219 sequences. (Running on oeis4.)