Let $(P_n)$ be a sequence such that $P_0 = 1$ and $P_n = (\log{(n+1)})^n$.
I'm trying to prove that $P_n ^2 \leq P_{n-1}\,P_{n+1}$ for $n \geq 1$ using an induction argument.
For $n=1$ we have that $(\log 2)^2 = 0.48$ and $1\cdot (\log 3)^2 = 1.206$, hence $P_1 ^{2} \leq P_{0}\,P_2$.
Given $n > 1$, suppose that $P_n ^2 \leq P_{n-1}\,P_{n+1}$, i.e $$ (\log (n+1))^{2n} \leq (\log (n))^{n-1}\, (\log (n+2))^{n+1} $$
we want to show that
$$ (\log (n+2))^{2(n+1)} \leq (\log (n+1))^{n}\, (\log (n+3))^{n+2}.$$
However, I've been trying here without any success.
Help?
Let $f(x)=x \log\log(x+1)$. Then $$f'(x)=\log \log(x+1)+\dfrac{x}{(x+1)\log(x+1)},$$ $$f''(x)=\dfrac{1}{(x+1)\log(x+1)}+\dfrac{1}{(x+1)^2\log(x+1)}-\dfrac{x}{(x+1)^2\log^2(x+1)}=\dfrac{1}{(x+1)\log(x+1)}\left( 1+\dfrac{1}{x+1}-\dfrac{1}{(x+1)\log(x+1)}\right )\geq 0.$$ So $y=f(x)$ is concave for $x\geq 0$. In particular $$f(n) \leq \dfrac{f(n-1)+f(n+1)}{2}.$$ So $$n\log \log(n+1)\leq \dfrac{(n-1)\log \log n + (n+1)\log \log(n+2)}{2}$$ which implies the inequality after exponentiating both sides.