cp's OEIS Frontend

A304906 L.g.f.: log(Product_{k>=1} (1 + x^(k^3))) = Sum_{n>=1} a(n)*x^n/n.

%I A304906 #14 Oct 03 2023 13:14:13
%S A304906 1,-1,1,-1,1,-1,1,7,1,-1,1,-1,1,-1,1,-9,1,-1,1,-1,1,-1,1,7,1,-1,28,-1,
%T A304906 1,-1,1,-9,1,-1,1,-1,1,-1,1,7,1,-1,1,-1,1,-1,1,-9,1,-1,1,-1,1,-28,1,7,
%U A304906 1,-1,1,-1,1,-1,1,55,1,-1,1,-1,1,-1,1,7,1,-1,1,-1,1,-1,1,-9,28,-1
%N A304906 L.g.f.: log(Product_{k>=1} (1 + x^(k^3))) = Sum_{n>=1} a(n)*x^n/n.
%H A304906 Andrew Howroyd, <a href="/A304906/b304906.txt">Table of n, a(n) for n = 1..1000</a>
%H A304906 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>.
%F A304906 G.f.: Sum_{k>=1} k^3*x^(k^3)/(1 + x^(k^3)).
%F A304906 a(n) = Sum_{d|n} (-1)^(n/d+1)*A010057(d)*d.
%F A304906 a(n) = 1 if n is an odd cubefree.
%F A304906 a(n) = -1 if n is an even cubefree.
%F A304906 Multiplicative with a(p^e) = (-1)^(p+1) * (p^(3*floor((e+3)/3))-1)/(p^3-1) + if(p = 2 and e == 0 (mod 3), 2^(e + 1) otherwise 0). - _Amiram Eldar_, Oct 03 2023
%e A304906 L.g.f.: L(x) = x - x^2/2 + x^3/3 - x^4/4 + x^5/5 - x^6/6 + x^7/7 + 7*x^8/8 + x^9/9 - x^10/10 + x^11/11 - x^12/12 + ...
%e A304906 exp(L(x)) = 1 + x + x^8 + x^9 + x^27 + x^28 + x^35 + x^36 + x^64 + x^65 + x^72 + x^73 + ... + A279329(n)*x^n + ...
%t A304906 nmax = 82; Rest[CoefficientList[Series[Log[Product[1 + x^k^3, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]]
%t A304906 nmax = 82; Rest[CoefficientList[Series[Sum[k^3 x^k^3/(1 + x^k^3), {k, 1, Floor[nmax^(1/3) + 1]}], {x, 0, nmax}], x]]
%t A304906 Table[DivisorSum[n, (-1)^(n/# + 1) # &, IntegerQ[#^(1/3)] &], {n, 82}]
%t A304906 f[p_, e_] := (-1)^(p+1) * (p^(3*Floor[(e+3)/3])-1)/(p^3-1) + If[p == 2 && Divisible[e, 3], 2^(e + 1), 0]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 03 2023 *)
%o A304906 (PARI) seq(n)={Vec(deriv(log(prod(k=1, sqrtnint(n, 3), 1 + x^(k^3) + O(x*x^n)))))} \\ _Andrew Howroyd_, Jul 20 2018
%o A304906 (PARI) a(n)={sumdiv(n, d, if(n%d^3, 0, (-1)^(n/d^3 + 1) * d^3))} \\ _Andrew Howroyd_, Jul 20 2018
%Y A304906 Cf. A000578, A010057, A004709, A113061, A279329, A300853.
%K A304906 sign,easy,mult
%O A304906 1,8
%A A304906 _Ilya Gutkovskiy_, May 20 2018
%E A304906 Keyword:mult added by _Andrew Howroyd_, Jul 20 2018