|
%I #24 Sep 18 2021 05:40:20
%S 1,0,1,1,2,3,5,8,13,21,35,55,93,149,248,403,671,1098,1827,3013,5013,
%T 8313,13859,23063,38534,64341,107715,180355,302565,507784,853507,
%U 1435415,2416941,4072272,6868062,11590807,19577555,33088481,55964327,94712212
%N Inverse Euler transform of A005169 (fountains of coins).
%C If G005169(x) = Sum_{i>=0} A005169(n)*x^n is the generating function of A005169, the a(n) are defined through G005169(x) = Product_{n>=1} 1/(1-x^n)^a(n), the inverse Euler transform of A005169.
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, p. 381.
%H Alois P. Heinz, <a href="/A226999/b226999.txt">Table of n, a(n) for n = 1..4178</a>
%H R. K. Guy, <a href="/A005169/a005169_6.pdf">Letter to N. J. A. Sloane</a>, Sep 25 1986.
%H R. K. Guy, <a href="/A005728/a005728.pdf">Letter to N. J. A. Sloane, 1987</a>
%H R. K. Guy, <a href="http://www.jstor.org/stable/2322249">The strong law of small numbers</a>. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
%H R. K. Guy, <a href="/A005165/a005165.pdf">The strong law of small numbers</a>. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
%F a(n) ~ 1 / (n * r^n), where r = A347901 = 0.57614876914275660229786857371993878235472466311897446868515653431946822937499... - _Vaclav Kotesovec_, Oct 09 2019
%t max = 100;
%t A005169 = Series[1 - Fold[Function[1 - x^#2/#1], 1, Range[max, 0, -1]], {x, 0, max}] // CoefficientList[#, x]&;
%t mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];
%t EULERi[b_] := Module[{a, c, i, d}, c = {}; For[i = 1, i <= Length[b], i++, c = Append[c, i*b[[i]] - Sum[c[[d]]*b[[i - d]], {d, 1, i - 1}]]]; a = {}; For[i = 1, i <= Length[b], i++, a = Append[a, (1/i)*Sum[mob[i, d]*c[[d]], {d, 1, i}]]]; Return[a]];
%t EULERi[A005169 // Rest] (* _Jean-François Alcover_, Jan 06 2020 *)
%Y Cf. A005169, A005170.
%K nonn
%O 1,5
%A _R. J. Mathar_, Jun 26 2013
|
