Jim Belk's answer gives a good explanation of the general context, but I thought I could add an unexpected example of where an equation like this comes up in analytic number theory.
(A small digression, but it is interesting!)
Specifically, a differential delay equation is at the heart of the theory dealing with integers without large prime factors.
Integers without large prime factors:
Let $\psi(x,y)$ denote the number of integers $n\leq x$, all of whose prime factors are $\leq y$. Example: $\psi(20,4)= 10$ because we have the numbers $1,2,3,4,6,8,9,12,16,18$.
Let $y=x^{\frac{1}{u}}$. Then we can ask the question, what does $\psi\left(x, x^{\frac{1}{u}}\right)$ look like as a function of $u$? We get a surprising result:
$$\psi(x, x^{\frac{1}{u}})=\rho(u)x+O\left(\frac{x}{\log x}\right)$$ where $\rho(u)$ satisfies the differential delay equation $$u \rho' (u)=\rho(u-1)$$ with the initial conditions $\rho(u)=1$ when $0\leq u\leq 1$. This is known as the Dickman De-Bruijn function.
There are some delicate details of what range of $u$ does the above hold, and how fast can we let $u$ go to infinity with $x$ and still have $\psi\left(x,x^{\frac{1}{u}}\right)\sim x\rho(u)$. It turns out, such questions are related to the error in the prime number theorem, and we can show that (Hildebrand 1984) the asymptotic holding uniformly in certain ranges of $u$ is equivalent to the Riemann Hypothesis. For a survey of current results regarding $\psi(x,y)$, see Tenenbaum and Hildebrand's 1993 paper: Integers without large prime factors.
(Side note: I posted an answer here about the Maier Matrix method. I just thought I would add, that the Dickman-De-Bruijn function plays an important role in what Maier did.)