Hey!
Inspired by your quest I wrote a first python script as well!
It's the prime factor finder... After some thinking i came up with the following, recursive algorithm, in pseudocode:
Edit: woke up and realized that the check for prime is unnecessary!

consider the candidate:
if candidate >=4 (2 and 3 are primes, 1 cannot be factorized)
if candidate is even
then 2 is a factor.
else
is any odd number from 3 to the root of the candidate a divisor of candidate?
and the divisor is a prime? then that number is a factor!

factor found?
print it and then consider (candidate/factor).
else
print the candidate and done!

and this is what it looks like when i implemented it in python:

from math import *

def findfactors(intarget):
    factor = -1
    if intarget >= 4:    # 2 and 3 are primes!
        if (intarget % 2)==0:
            factor = 2
        else:
            checkto = int(sqrt(intarget))
            for candidate in range(3,checkto+1,2):
                if intarget%candidate == 0:
                    factor = candidate
                    break
    if factor != -1:
        print factor, ' ',
        findfactors(intarget/factor)
    else:
        print intarget

I think it can be optimized a bit by passing the last found factor as the value to
start with, when searching for the next divisor....

looking forward to seeing what you came up with!