We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, of a Boolean function associated with a linear recurrence sequence in a natural way.