cp's OEIS Frontend

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

%I A296601 #28 Jun 24 2019 20:10:06
%S A296601 1,9,28,81,126,330,344,833,973,1754,1332,5034,2198,5658,8688,13313,
%T A296601 4914,28779,6860,54106,45752,33482,12168,254954,93751,78906,255880,
%U A296601 505698,24390,1510700,29792,1671169,1791312,647114,2819544,12637371,50654,2282346,14779520,34058298,68922,68084220
%N A296601 L.g.f.: -log(Product_{k>=1} (1 - k*x^k)^k) = Sum_{n>=1} a(n)*x^n/n.
%H A296601 Seiichi Manyama, <a href="/A296601/b296601.txt">Table of n, a(n) for n = 1..5000</a>
%H A296601 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F A296601 G.f.: Sum_{k>=1} k^3*x^k/(1 - k*x^k).
%F A296601 a(n) = Sum_{d|n} d^(n/d+2).
%F A296601 a(p) = p^3 + 1 where p is a prime.
%F A296601 From _Seiichi Manyama_, Jun 24 2019: (Start)
%F A296601 Suppose given two sequences f(n) and g(n), n>0, we define a new sequence a(n), n>0, by a(n) = Sum_{d|n} d*f(d)*g(d)^(n/d).
%F A296601 L.g.f.: -log(Product_{n>0} (1 - g(n)*x^n)^f(n)) = Sum_{n>0} a(n)*x^n/n. (See A266964.)
%F A296601 If we set f(n) = n and g(n) = n, we get this sequence. (End)
%e A296601 L.g.f.: L(x) = x + 9*x^2/2 + 28*x^3/3 + 81*x^4/4 + 126*x^5/5 + 330*x^6/6 + 344*x^7/7 + 833*x^8/8 + 973*x^9/9 + ...
%e A296601 exp(L(x)) = 1 + x + 5*x^2 + 14*x^3 + 42*x^4 + 103*x^5 + 289*x^6 + 690*x^7 + 1771*x^8 + 4206*x^9 + ... + A266941(n)*x^n + ...
%t A296601 nmax = 42; Rest[CoefficientList[Series[-Log[Product[(1 - k x^k)^k, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]]
%t A296601 nmax = 42; Rest[CoefficientList[Series[Sum[k^3 x^k/(1 - k x^k), {k, 1, nmax}], {x, 0, nmax}], x]]
%t A296601 a[n_] := Sum[d^(n/d + 2), {d, Divisors[n]}]; Table[a[n], {n, 1, 42}]
%o A296601 (PARI) N=66; x='x+O('x^N); Vec(x*deriv(-log(prod(k=1, N, (1-k*x^k)^k)))) \\ _Seiichi Manyama_, Jun 02 2019
%Y A296601 Column k=2 of A308502.
%Y A296601 Cf. A001157, A078308, A266941, A266964.
%K A296601 nonn
%O A296601 1,2
%A A296601 _Ilya Gutkovskiy_, May 20 2018