Let $\varphi(m)$ for integers $m\geq 1$ the Euler's totient function. Then for integers $n\geq 1$ we define the recurrence $$a_{n+1}=n\cdot\varphi(a_n)+a_{\varphi(n)}\tag{1}$$ with seed value $a_1=1$.
Question. I suspect (my computational evidence is very small since I've calculated only the first 80 terms) that $$\log a_n=O(n)\tag{2}$$ as $n\to\infty$. Am I right? Many thanks.
Computational facts and remarks as a motivation to study the recurrence. The sequence $a_n$ starts as $$1, 2, 3, 8, 18, 38, 110, 318, 840, 1766\ldots$$ And seems (it isn't related to our Question) that maybe the sequence $$-1+a_n$$ for $n>1$ has infinitely many terms without repeated prime factors. The most obvious fact about the Euler's totient is $\varphi(m)\leq m$ (maybe using this inequality and Stirling's approximation can be deduced a statement, but I believe that it doesn't improve my conjecture $(2)$). Finally in next Appendix I add a program that I've used with a Pari/GP calculator to plot the sequence $$b_n:=\log a_n$$ for $1\leq n\leq 80$.
Appendix:
N = 80;
a = vector(N); a[1]=1;
for( k = 1, N-1, { a[k+1] = k*eulerphi(a[k])+a[eulerphi(k)];});
a;
b = vector(N);
for( k = 1, N, { b[k] = log(a[k]);});
x = vector(N); for( k = 1, N, { x[k] = k;});
plothraw(x,b)