login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A320777
Inverse Euler transform of the number of distinct prime factors (without multiplicity) function A001221.
7
1, 0, 1, 1, 0, 0, 0, 0, -1, -1, 1, 1, 0, -1, 0, 1, -1, -2, 1, 3, 1, -2, -2, 1, 0, -4, 0, 6, 6, -4, -8, 1, 4, -4, -5, 10, 16, -4, -25, -7, 17, 5, -16, 2, 42, 12, -58, -48, 40, 59, -27, -44, 67, 86, -103, -187, 36, 236, 45, -213, -5, 284, -23, -526, -188, 663, 520
OFFSET
0,18
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). The constant term 1 is sometimes taken to be the zeroth part of the Euler transform.
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[Array[PrimeNu, 100]]
CROSSREFS
Number theoretical functions: A000005, A000010, A000203, A001055, A001221, A001222, A008683, A010054.
Inverse Euler transforms: A059966, A320767, A320776, A320778, A320779, A320780, A320781, A320782.
Sequence in context: A174892 A317656 A319136 * A350380 A069929 A304081
KEYWORD
sign
AUTHOR
Gus Wiseman, Oct 22 2018
STATUS
approved