We consider a particle performing a stochastic motion on a one-dimensional lattice with jump lengths distributed according to a power law with exponent μ+1. Assuming that the walker moves in the presence of a distribution a(x) of targets (traps) depending on the spatial coordinate x, we study the probability that the walker will eventually find any target (will eventually be trapped). We focus on the case of power-law distributions a(x)∼x−α and we find that, as long as μ<α, there is a finite probability that the walker will never be trapped, no matter how long the process is. This result is shown via analytical arguments and numerical simulations which also evidence the emergence of slow searching (trapping) times in finite-size system. The extension of this finding to higher-dimensional structures is also discussed.