Explicit bounds for Buchstab's function

Buchstab’s function $\omega (u)$ describes the distribution of integers without small prime factors. We establish numerically explicit upper and lower bounds for $\omega (u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.