Find numbers that are palindromic in consecutive number bases
A small performance improvement is possible in the listToInt function,
by using multiplications only instead of exponentiation
(which is Horner's method):

# converts number in base b list representation to integer
def listToInt(digitList, base):
    value = 0
    for val in digitList:
        value = value * base + val
    return value


On my computer this reduced the time to compute the results for
\$ b = 1270, \ldots, 1286 \$ from 130 to 101 seconds.