a-l-p-h-a

<?php
// Small recursive function to test for prime factorials.
// this is quickly written in php.

function rec($int){
	for ($i = 2; $i <= $int; $i++){
		if (($int % $i) == 0){
			echo "$i<br/>\n";
			rec($int/$i);
			break;
		} elseif ($i > $int/2) {
			echo "last $int<br/>\n";
			break;
		}
	}
}

rec(1125); // where 1125 is whatever.

?>