Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A296133
Number of twice-factorizations of n of type (Q,R,Q).
4
1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 5, 1, 2, 2, 3, 1, 5, 1, 3, 2, 2, 2, 7, 1, 2, 2, 5, 1, 5, 1, 3, 3, 2, 1, 7, 1, 3, 2, 3, 1, 5, 2, 5, 2, 2, 1, 9, 1, 2, 3, 6, 2, 5, 1, 3, 2, 5, 1, 9, 1, 2, 3, 3, 2, 5, 1, 7, 2, 2, 1, 9, 2, 2, 2
OFFSET
1,6
EXAMPLE
The a(36) = 7 twice-factorizations are (2*3)*(6), (6)*(2*3), (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]]}]];
sps[{}]:={{}}; sps[set:{i_, ___}]:=Join@@Function[s, Prepend[#, s]&/@sps[Complement[set, s]]]/@Cases[Subsets[set], {i, ___}];
Table[Length[Join@@Function[fac, Select[Join@@Permutations/@sps[fac], SameQ@@Times@@@#&]]/@sfs[n]], {n, 100}]
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 05 2017
STATUS
approved