login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A154058 A027574 A059047 * A222728 A223649 A205434
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
a(8)-a(18) from Donovan Johnson, Mar 30 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)