We establish a novel improvement of the classical discrete Hardy inequality, which gives the discrete version of a recent (continuous) inequality of Frank, Laptev, and Weidl. Our arguments build on certain weighted inequalities based on discrete analogues of symmetric decreasing rearrangement techniques.