The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118205 Euler transform of the negative of the Liouville function. 4
 1, -1, 1, 0, -1, 2, -2, 2, 0, -2, 3, -2, 1, 2, -3, 3, -2, 0, 3, -2, 3, -2, 0, 2, -2, 3, -1, 0, 1, -2, 5, 0, 0, 1, -2, 1, 1, 2, 0, 1, -2, 1, 4, -1, 4, -2, -3, 6, -2, 5, 6, -8, 6, -4, 2, 9, -8, 7, -4, -1, 11, -1, 5, 1, -8, 5, 2, 4, 7, -8, 4, 2, 1, 14, -2, 0, -1, -6, 19, 2, 5, 6, -15, 12, 1, 3, 18, -17, 1, 9, 0, 29, -4, -3, 4, -13, 14, 17, 2, 0, -4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS FORMULA G.f.: A(x) = Product_{k>=1}(1 - x^k)^lambda(k) where lambda(k) is the Liouville function, A008836. MATHEMATICA nmax = 100; lambda[k_Integer?Positive] := If[ k > 1, (-1)^Total[ Part[Transpose[FactorInteger[k]], 2] ], 1 ]; CoefficientList[ Series[ Product[ (1 - x^k)^lambda[k], {k, 1, nmax} ], {x, 0, nmax} ], x ] (* Second program (needs Mma >= 7.0): *) nmax = 100; Product[(1 - x^n)^LiouvilleLambda[n], {n, 1, nmax}] + O[x]^(nmax+1) // CoefficientList[#, x]& (* Jean-François Alcover, Jan 08 2020 *) CROSSREFS Cf. A061020, A117208, A118206, A118207, A118208. Sequence in context: A118664 A223175 A322213 * A216265 A336694 A130277 Adjacent sequences:  A118202 A118203 A118204 * A118206 A118207 A118208 KEYWORD sign,easy AUTHOR Stuart Clary, Apr 15 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 24 04:08 EST 2020. Contains 338607 sequences. (Running on oeis4.)