OFFSET
1,2
COMMENTS
Also numbers that can be factored in such a way that the length is divisible by the least common multiple.
EXAMPLE
The sequence of terms together with their prime indices begins:
1: {}
4: {1,1}
16: {1,1,1,1}
27: {2,2,2}
32: {1,1,1,1,1}
64: {1,1,1,1,1,1}
96: {1,1,1,1,1,2}
128: {1,1,1,1,1,1,1}
144: {1,1,1,1,2,2}
192: {1,1,1,1,1,1,2}
216: {1,1,1,2,2,2}
256: {1,1,1,1,1,1,1,1}
288: {1,1,1,1,1,2,2}
324: {1,1,2,2,2,2}
432: {1,1,1,1,2,2,2}
For example, 24576 has three suitable factorizations:
(2*2*2*2*2*2*2*2*2*2*2*12)
(2*2*2*2*2*2*2*2*2*2*4*6)
(2*2*2*2*2*2*2*2*2*3*4*4)
so is in the sequence.
MATHEMATICA
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
Select[Range[1000], Select[facs[#], And@@IntegerQ/@(Length[#]/#)&]!={}&]
CROSSREFS
These factorizations are counted by A340851.
The reciprocal version is A340853.
A143773 counts partitions whose parts are multiples of the number of parts.
A320911 can be factored into squarefree semiprimes.
A340597 have an alt-balanced factorization.
- Factorizations -
A316439 counts factorizations by product and length.
A339846 counts factorizations of even length.
A339890 counts factorizations of odd length.
A340653 counts balanced factorizations.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 04 2021
STATUS
approved