|
%I #13 Feb 28 2022 11:19:08
%S 1,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,16,0,
%T 0,0,0,0,4,0,4,0,0,0,12,0,0,0,10,0,0,0,0,0,0,0,28,0,0,0,0,0,0,0,16,1,
%U 0,0,12,0,0,0,4,0,12,0,0,0,0,0,40,0,0,0,6,0,0,0,4,0,0,0,28,0,0,0,16
%N Number of ordered factorizations of n into 4 factors > 1.
%H Alois P. Heinz, <a href="/A341880/b341880.txt">Table of n, a(n) for n = 16..20000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OrderedFactorization.html">Ordered Factorization</a>
%F Dirichlet g.f.: (zeta(s) - 1)^4.
%F a(n) = 6 * A000005(n) - 4 * A007425(n) + A007426(n) - 4 for n > 1.
%p b:= proc(n) option remember; series(x*(1+add(b(n/d),
%p d=numtheory[divisors](n) minus {1, n})), x, 5)
%p end:
%p a:= n-> coeff(b(n), x, 4):
%p seq(a(n), n=16..112); # _Alois P. Heinz_, Feb 22 2021
%t b[n_] := b[n] = Series[x*(1 + Sum[b[n/d],
%t {d, Divisors[n] ~Complement~ {1, n}}]), {x, 0, 5}];
%t a[n_] := Coefficient[b[n], x, 4];
%t Table[a[n], {n, 16, 112}] (* _Jean-François Alcover_, Feb 28 2022, after _Alois P. Heinz_ *)
%Y Column k=4 of A251683.
%Y Cf. A000005, A007425, A007426, A070824, A074206, A200221, A341881, A341882.
%K nonn
%O 16,9
%A _Ilya Gutkovskiy_, Feb 22 2021
|
