|
%I #6 Sep 11 2018 17:01:44
%S 1,1,1,2,1,2,1,6,2,2,1,8,1,2,2,24,1,6,1,8,2,2,1,42,2,2,6,8,1,8,1,112,
%T 2,2,2,38,1,2,2,42,1,8,1,8,8,2,1,244,2,6,2,8,1,24,2,42,2,2,1,58,1,2,8,
%U 568,2,8,1,8,2,8,1,268,1,2,6,8,2,8,1,244,24
%N Number of multimin tree-factorizations of n.
%C A multimin factorization of n is an ordered factorization of n into factors greater than 1 such that the sequence of minimal primes dividing each factor is weakly increasing. A multimin tree-factorization of n is either the number n itself or a sequence of multimin tree-factorizations, one of each factor in a multimin factorization of n with at least two factors.
%F a(prime^n) = A118376(n).
%F a(product of n distinct primes) = A005804(n).
%e The a(12) = 8 multimin tree-factorizations:
%e 12,
%e (2*6), (4*3), (6*2), (2*2*3),
%e (2*(2*3)), ((2*2)*3), ((2*3)*2).
%e Or as series-reduced plane trees of multisets:
%e 112,
%e (1,12), (11,2), (12,1), (1,1,2),
%e (1,(1,2)), ((1,1),2)), ((1,2),1).
%t facs[n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#1,d]&)/@Select[facs[n/d],Min@@#1>=d&],{d,Rest[Divisors[n]]}]];
%t mmftrees[n_]:=Prepend[Join@@(Tuples[mmftrees/@#]&/@Select[Join@@Permutations/@Select[facs[n],Length[#]>1&],OrderedQ[FactorInteger[#][[1,1]]&/@#]&]),n];
%t Table[Length[mmftrees[n]],{n,100}]
%Y Cf. A001055, A005804, A020639, A118376, A196545, A255397, A281113, A281118, A281119, A295279, A317545, A317546, A318577, A319119.
%K nonn
%O 1,4
%A _Gus Wiseman_, Sep 10 2018
|
