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.
%I A046149 #20 Feb 16 2025 08:32:38 %S A046149 0,77,679,6788,68889,168889,2677889,26888999,126888999,3778888999, %T A046149 13778888999,113778888999,1113778888999,11113778888999, %U A046149 277777788888899,1277777788888899,11277777788888899,111277777788888899 %N A046149 Smallest n-digit number with maximal multiplicative persistence A014553. %C A046149 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 %H A046149 N. J. A. Sloane, <a href="http://neilsloane.com/doc/persistence.html">The persistence of a number</a>, J. Recreational Math., 6 (1973), 97-98. %H A046149 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MultiplicativePersistence.html">Multiplicative Persistence.</a> %Y A046149 Cf. A014553, A046148, A046150. %K A046149 nonn,base %O A046149 1,2 %A A046149 _Eric W. Weisstein_ %E A046149 a(8)-a(18) from _Donovan Johnson_, Mar 30 2010