Generate a Python program that has the following intention:

The intention of the program below is to find all 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 and checking if n is divisible by each number. If it is, the factor is added to a list and the function recursively calls itself with the divided number (n // i). The final list of prime factors is returned. If no prime factors are found, an empty list is returned. The letter e should appear at least 36 times.
user