I know the series $$\sum_{N \leq n}{\frac{1}{n \ln(n) \ln(\ln(n)) ... (\ln^k)(n)}}$$ ($\ln^k$ is $\ln$ iterated $k$ times, not $\ln$ to the power of $k$) diverges for all constant $k$, as long as $N$ is big enough for it to be defined. However, I was wondering what happens if we extend that to infinity.
We can define a function $$f(n) = \begin{cases} 1 & n\leq 1 \\ n\cdot f(\ln(n)) & 1 < n \end{cases} $$ Or equivalently $f(n) = n \ln(n) \ln(\ln(n)) ...$ as long as the $\ln$ is greater than $1$.
Does the series $$\sum_{n=1}^{\infty} {\frac{1}{f(n)}}$$ converge? I thought about using the integral test and partitioning it based on the tetrations of $e$, but I can't think of any way to estimate $$\int_{^{k}e}^{^{k+1}e}{\frac{dx}{x \ln(x) \ln(\ln(x)) ... (\ln^k)(x)}}$$