A031352 6-multiplicative persistence: number of iterations of "multiply 6th powers of digits" needed to reach 0 or 1.

0, 3, 3, 2, 3, 3, 3, 3, 3, 1, 1, 3, 3, 2, 3, 3, 3, 3, 3, 1, 3, 2, 3, 3, 2, 3, 3, 3, 2, 1, 3, 3, 3, 3, 2, 2, 3, 2, 2, 1, 2, 3, 3, 3, 2, 2, 2, 2, 3, 1, 3, 2, 2, 2, 2, 2, 3, 2, 2, 1, 3, 3, 2, 2, 2, 3, 2, 2, 3, 1, 3, 3, 3, 2, 3, 2, 2, 2, 2, 1, 3, 3, 2, 2, 2, 2, 2, 3, 2, 1, 3, 2, 2, 3, 2, 3, 2, 2, 3