OFFSET
1,4
COMMENTS
a(n) is also the number of ways to choose a perfect divisor d|n and then a sequence of log_d(n) strict factorizations of d.
EXAMPLE
The a(36) = 9 twice-factorizations are (2*3)*(2*3), (2*3)*(6), (6)*(2*3), (6)*(6), (2*3*6), (2*18), (3*12), (4*9), (36).
MATHEMATICA
sfs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[sfs[n/d], Min@@#>d&]], {d, Rest[Divisors[n]]}]];
Table[Sum[Length[sfs[n^(1/g)]]^g, {g, Divisors[GCD@@FactorInteger[n][[All, 2]]]}], {n, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 05 2017
STATUS
approved