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.

Let $\mathbb{P}=\{p_1,p_2,\cdots ,p_i,\cdots \}$ be the set of prime numbers (or more generally a set of pairwise co-prime elements). Let us denote $A_p^{a,b}=\{p^{an+b}m\mid n\in \mathbb{N}\cup \left\{0\right\};m\in \mathbb{N},p\mathrm{does}\mathrm{not}\mathrm{divide}m\}$, where $a\in \mathbb{N},b\in \mathbb{N}\cup \left\{0\right\}$. Then for arbitrary finite set $B$, $B\subset \mathbb{P}$ holds $$d\left(\bigcap _{p_i\in B}{A}_{p_i}^{a_i,b_i}\right)=\prod _{p_i\in B}d\left(A_{p_i}^{a_i,b_i}\right),$$ and $$d\left(A_{p_i}^{a_i,b_i}\right)=\frac{\frac{1}{p_i^{b_i}}\left(1-\frac{1}{p_i}\right)}{1-\frac{1}{p_i^{a_i}}}.$$ If we denote $$A=\left\{\frac{\frac{1}{p^b}\left(1-\frac{1}{p}\right)}{1-\frac{1}{p^a}}\mid p\in \mathbb{P},a\in \mathbb{N},b\in \mathbb{N}\cup \left\{0\right\}\right\},$$ where $\mathbb{P}$ is the set of all prime numbers, then for closure of set $A$ holds $$\mathrm{cl}A=A\cup B\cup \{0,1\},$$ where $B=\left\{\frac{1}{p^b}\left(1-\frac{1}{p}\right)\mid p\in \mathbb{P},b\in \mathbb{N}\cup \left\{0\right\}\right\}$.