from numba import jit, int64

def f1(x, y):
    o = 0
    for i in range(x):
        for j in range(i, y, 2):
            if (i + j) % 13 != 0:
                o += i - j
    return o

f1(1000, 1000)

-76923768

%timeit f1(1000, 1000)

10 loops, best of 3: 43.1 ms per loop

@jit(int64(int64, int64), nopython=False)
def f2(x, y):
    o = 0
    for i in range(x):
        for j in range(i, y, 2):
            if (i + j) % 13 != 0:
                o += i - j
    return o

f2(1000, 1000)

-76923768

%timeit f2(1000, 1000)

1000 loops, best of 3: 527 µs per loop