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.

A243198 Least number k such that k + DigProd(k) = 10^n.

Original entry on oeis.org

5, 91, 919, 7795, 100000, 1000000, 10000000, 100000000, 1000000000, 9968647168, 100000000000, 1000000000000, 9999761914432, 100000000000000, 1000000000000000, 10000000000000000, 100000000000000000, 1000000000000000000, 9999982446427242496
Offset: 1

Views

Author

Derek Orr, Jun 01 2014

Keywords

Comments

a(n) <= 10^n for all n.

Examples

			919 + 9*1*9 = 1000 = 10^3. Since 919 is the smallest number with this property, a(3) = 919.
		

Crossrefs

Programs

  • PARI
    DP(n)={p=1;d=digits(n);return(prod(i=1,#d,d[i]))}
    a(n)=for(k=10^n-9^n,10^n,if((k+DP(k))==10^n,return(k)))
    n=1;while(n<100,print1(a(n),", ");n++)

Extensions

a(8)-a(19) from Hiroaki Yamanouchi, Jul 10 2014