 Quotient tower of a partition

The $e$-quotient tower recursively takes the $e$-quotient of every partition at the preceding level. For $e>1$, the sum of the sizes at each new level is at most $1/e$ times the preceding sum, so every partition has finite depth. For $e=1$, the quotient is the original partition and the tower has finite depth only for the empty partition.