def isPrime(n):
    if n < 2:
        return False
wheel = [1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6]
w, next = 2, 0
while w * w <= n:
    if n % w == 0:
        return False
w = w + wheel[next]
next = next + 1
if next > 10:
    next = 3
return True
finding the lowest collatz sequence that gives more that 65 primes