Generate a Python program that has the following intention:

The intention of the program below is to find the prime factors of a positive integer n. The function p1(n) does this by iterating through numbers from 2 to the square root of n (rounded up to the nearest integer) and checking if n is divisible by each number. If it is divisible, the function returns a list containing the prime factor and the result of calling p1 on the remainder of n. If no prime factors are found, an empty list is returned. Provide your reponse without using the word p1.
user