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!)
A046150 Largest n-digit number with maximal multiplicative persistence A014553. 3
9, 77, 976, 8876, 98886, 997762, 9999996, 99988862, 999888621, 9998888773, 99988887731, 999888877311, 9998888773111, 99988887731111, 998888887777772, 9988888877777721, 99999999998777772, 999999999987777721, 9999999999877777211, 99999999998777772111 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Since there exists no number < 10^233 with multiplicative persistence 12, a(n) = 99999999998777772 * 10^(n-17) + (10^(n-17)-1)/9 for 17 <= n < 233. - Sean A. Irvine, Apr 05 2021
LINKS
Sean A. Irvine, Java program (github)
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: A254659 A346847 A355372 * A124131 A000445 A046196
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
a(8)-a(18) from Donovan Johnson, Mar 30 2010
a(19)-a(20) from Sean A. Irvine, Apr 05 2021
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 April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)