Hello,

let's define the notion of order of primality in such a way: $n$ is a prime of order $k$ if and only if $k$ is the smallest non negative integer such that $\pi^{(k)}(n)$ is not a prime number, where $\pi^{(0)}(n)=n$ and for all $m$, $\pi^{(m+1)}(n)=\pi(\pi^{(m)}(n))$. Now let's write $\pi_{k}(x)$ for the number of primes of order $k$ not exceeding $x$. It is quite easy to see that every non negative integer $n$ verifies the equality $n=\displaystyle{\sum_{k\geq 0}\pi_{k}(n)}$ and that $\pi(n)=n-\pi_{0}(n)$. Moreover, for all $(k,n)\in\mathbb{N}^{2}$, $\pi_{k+1}(n)\leq\pi_{k}(n)$.

My question is: is there a function $f$ such that for all $(k,n)\in\mathbb{N}^{2}$, $\pi_{k+1}(n)=f(\pi_{k}(n))+O(1)$?

Thank you in advance.