Let $\mathbb{N}$ be the set of positive integers and let $s\in \mathbb{N}$. We denote by $d^s$ the arithmetic function given by $d^s\left(n\right)={\left(d\left(n\right)\right)}^s$, where $d\left(n\right)$ is the number of positive divisors of $n$. Moreover, for every $\ell ,m\in \mathbb{N}$ we denote by ${\delta }^{s,\ell ,m}\left(n\right)$ the sequence $$\underset{m\text{-times}}{\underbrace{d^s(d^s(...d^s(d^s\left(n\right)+\ell )+\ell ...)+\ell )}}=\left\{\begin{array}{cc}{d}^s\left(n\right)\hfill & \text{for}m=1,\hfill \\ d^s(d^s\left(n\right)+\ell )\hfill & \text{for}m=2,\hfill \\ d^s(d^s(d^s\left(n\right)+\ell )+\ell )\hfill & \text{for}m=3,\hfill \\ ⋮\hfill \end{array}\right.$$ We present classical and nonclassical notes on the sequence ${\left({\delta }^{s,\ell ,m}\left(n\right)\right)}_{m\ge 1}$, where $\ell$, $n$, $s$ are understood as parameters.