%I A046500
%S A046500 2,11,29,47,277,769,8867,186889,2678789,26899889,3778888999,
%T A046500 277777788888989
%N A046500 Smallest prime with multiplicative persistence n.
%C A046500 The persistence of a number is the number of times you need to multiply 
               the digits together before reaching a single digit.
%H A046500 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_022.htm">
               Puzzle page</a>
%H A046500 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 A046500 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               MultiplicativePersistence.html">Link to a section of The World of 
               Mathematics.</a>
%e A046500 47 -> 28 -> 16 -> 6 has persistence 3.
%Y A046500 Cf. A003001, A014120.
%Y A046500 Sequence in context: A136317 A090389 A061238 this_sequence A062123 A117560 
               A024178
%Y A046500 Adjacent sequences: A046497 A046498 A046499 this_sequence A046501 A046502 
               A046503
%K A046500 nonn,hard,base,nice
%O A046500 0,1
%A A046500 Patrick De Geest (pdg(AT)worldofnumbers.com), Sep 15 1998.
%E A046500 Value for n=10 and n=11 found by Jud McCranie.