cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A046150 Largest n-digit number with maximal multiplicative persistence A014553.

Original entry on oeis.org

9, 77, 976, 8876, 98886, 997762, 9999996, 99988862, 999888621, 9998888773, 99988887731, 999888877311, 9998888773111, 99988887731111, 998888887777772, 9988888877777721, 99999999998777772, 999999999987777721, 9999999999877777211, 99999999998777772111
Offset: 1

Views

Author

Keywords

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

Crossrefs

Extensions

a(8)-a(18) from Donovan Johnson, Mar 30 2010
a(19)-a(20) from Sean A. Irvine, Apr 05 2021

A046149 Smallest n-digit number with maximal multiplicative persistence A014553.

Original entry on oeis.org

0, 77, 679, 6788, 68889, 168889, 2677889, 26888999, 126888999, 3778888999, 13778888999, 113778888999, 1113778888999, 11113778888999, 277777788888899, 1277777788888899, 11277777788888899, 111277777788888899
Offset: 1

Views

Author

Keywords

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

Crossrefs

Extensions

a(8)-a(18) from Donovan Johnson, Mar 30 2010
Showing 1-2 of 2 results.