“…The speed of the computation increases with the size of the gap. Lacunary recurrences have been studied for many types of sequences including Bernoulli numbers [1,8,9,11], Euler numbers [8], k-Fibonacci numbers (which are Fibonacci polynomials at positive integer values) [4], Eisenstein series [10], Tribonacci numbers [6], more general sequences that include Bernoulli, Euler, Fibonacci and Genocchi numbers [5], and sequences satisfying an arbitrary linear recurrence [3,12,13].…”