|
%I #45 Mar 31 2018 06:36:16
%S 1,1,2,3,4,6,9,12,16,21,28,36,47,60,76,96,120,150,185,228,280,342,416,
%T 504,608,731,877,1048,1249,1484,1759,2079,2452,2885,3387,3968,4640,
%U 5413,6304,7328,8504,9852,11395,13159,15172,17468,20082,23056,26434,30267
%N Number of partitions of n into squarefree parts.
%C Euler transform of the absolute values of A008683. - _Tilman Neumann_, Dec 13 2008
%C Euler transform of A008966. - _Vaclav Kotesovec_, Mar 31 2018
%H Alois P. Heinz, <a href="/A073576/b073576.txt">Table of n, a(n) for n = 0..10000</a>
%F G.f.: 1/Product_{k>0} (1-x^A005117(k)).
%F a(n) = 1/n*Sum_{k=1..n} A048250(k)*a(n-k).
%F a(n) = A000041(n) - A114374(n) - A117395(n), n>0. - _Reinhard Zumkeller_, Mar 11 2006
%F G.f.: 1 + Sum_{i>=1} mu(i)^2*x^i / Product_{j=1..i} (1 - mu(j)^2*x^j). - _Ilya Gutkovskiy_, Jun 05 2017
%F a(n) ~ exp(2*sqrt(n)) / (4*Pi^(3/2)*n^(1/4)). - _Vaclav Kotesovec_, Mar 24 2018
%p with(numtheory):
%p a:= proc(n) option remember; `if`(n=0, 1, add(add(d*
%p abs(mobius(d)), d=divisors(j)) *a(n-j), j=1..n)/n)
%p end:
%p seq(a(n), n=0..60); # _Alois P. Heinz_, Mar 05 2015
%t Table[Length[Select[Boole /@ Thread /@ SquareFreeQ /@ IntegerPartitions[n], FreeQ[#, 0] &]], {n, 48}] (* _Jayanta Basu_, Jul 02 2013 *)
%t a[n_] := a[n] = If[n==0, 1, Sum[Sum[d*Abs[MoebiusMu[d]], {d, Divisors[j]}] * a[n-j], {j, 1, n}]/n]; Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Oct 10 2015, after _Alois P. Heinz_ *)
%t nmax = 60; CoefficientList[Series[Exp[Sum[Sum[Abs[MoebiusMu[k]] * x^(j*k) / j, {k, 1, Floor[nmax/j] + 1}], {j, 1, nmax}]], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Mar 31 2018 *)
%o (Haskell)
%o a073576 = p a005117_list where
%o p _ 0 = 1
%o p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
%o -- _Reinhard Zumkeller_, Jun 01 2015
%Y Cf. A058647.
%Y Cf. A087188.
%Y Cf. A225244.
%Y Cf. A114374.
%K nonn
%O 0,3
%A _Vladeta Jovovic_, Aug 27 2002
|
