euler-pythontr

class xseq:
    def isprime(self, n):
        if n == 2 or n == 3: return True
        if n < 2 or n%2 == 0: return False
        if n < 9: return True
        if n%3 == 0: return False
        r = int(n**0.5)
        f = 5
        while f <= r:
            if n%f == 0: return False
            if n%(f+2) == 0: return False
            f +=6
        return True

    def primes(self, inset=0, offset=0):
        list = []
        for i in range(inset, offset):
            if self.isprime(i):
                list.append(i)
        return list

### Run ###

eul = 600851475143
eul2 = 13195
primelist = myseq.primes(1,int(eul/2))
cont = []

for i in range(1, len(primelist)):
    if (eul % primelist[i]) == 0:
        eul = eul / primelist[i]
        cont.append(primelist[i])
        i -= 1

print(cont)