%I #12 Jan 12 2020 23:45:17
%S 0,4,5,4,3,4,4,3,3,1,1,4,5,4,3,4,4,3,3,1,4,4,4,3,2,3,4,2,3,1,5,4,3,3,
%T 4,3,4,3,4,1,4,3,3,2,2,3,3,3,3,1,3,2,4,2,3,2,3,2,3,1,4,3,3,3,2,3,2,2,
%U 3,1,4,4,4,3,3,2,4,3,2,1,3,2,3,3,2,2,3,3,3,1,3,3,4,3,3,3,2,3,3
%N 3-multiplicative persistence: number of iterations of "multiply 3rd powers of digits" needed to reach 0 or 1.
%H Seiichi Manyama, <a href="/A031349/b031349.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MultiplicativePersistence.html">Multiplicative Persistence</a>
%K nonn,base
%O 1,2
%A _Eric W. Weisstein_