login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A046149
Smallest n-digit number with maximal multiplicative persistence A014553.
2
0, 77, 679, 6788, 68889, 168889, 2677889, 26888999, 126888999, 3778888999, 13778888999, 113778888999, 1113778888999, 11113778888999, 277777788888899, 1277777788888899, 11277777788888899, 111277777788888899
OFFSET
1,2
COMMENTS
Since there exists no number k <= 10^200 with multiplicative persistence 12, a(n) = (10^(n-15)-1)/9*10^15 + 277777788888899 for 15 <= n <= 200. - A.H.M. Smeets, Sep 18 2018
LINKS
N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98.
Eric Weisstein's World of Mathematics, Multiplicative Persistence.
CROSSREFS
KEYWORD
nonn,base
EXTENSIONS
a(8)-a(18) from Donovan Johnson, Mar 30 2010
STATUS
approved