%I A031346
%S A031346 0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,1,1,1,1,
%T A031346 2,2,2,2,2,3,1,1,1,2,2,2,2,3,2,3,1,1,2,2,2,3,2,3,2,3,1,1,2,2,2,2,3,
%U A031346 2,3,3,1,1,2,2,3,3,2,4,3,3,1,1,2,2,2,2,3,3,3,3,1,1,2,3,3,3,3,3,3,2
%N A031346 Multiplicative persistence: number of iterations of "multiply digits" 
               needed to reach a number < 10.
%H A031346 T. D. Noe, <a href="b031346.txt">Table of n, a(n) for n=0..10000</a>
%H A031346 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/persistence.html">
               The persistence of a number</a>, J. Recreational Math., 6 (1973), 
               97-98.
%H A031346 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               MultiplicativePersistence.html">Link to a section of The World of 
               Mathematics.</a>
%Y A031346 Cf. A031347.
%Y A031346 Sequence in context: A063059 A102675 A143544 this_sequence A087472 A054348 
               A037813
%Y A031346 Adjacent sequences: A031343 A031344 A031345 this_sequence A031347 A031348 
               A031349
%K A031346 nonn,base
%O A031346 0,26
%A A031346 Eric Weisstein (eric(AT)weisstein.com)