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!)
A178500 a(n) = 10^n * signum(n). 7
0, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000, 100000000000, 1000000000000, 10000000000000, 100000000000000, 1000000000000000, 10000000000000000, 100000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n-1) is the minimum difference between an n-digit number (written in base 10, nonzero leading digit) and the product of its digits. For n > 1, it is also a number meeting that bound. See A070565. - Devin Akman, Apr 17 2019
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..999
FORMULA
a(n) = A011557(n) * A057427(n).
For n > 0, a(n) = A011557(n).
a(n) = 10 * A178501(n).
a(n) = A000533(n) - 1.
A061601(a(n)) = A109002(n+1).
MATHEMATICA
Array[10^#*Sign[#] &, 20, 0] (* Michael De Vlieger, Apr 21 2019 *)
CROSSREFS
Partial sums of A063945.
Sequence in context: A260521 A136873 A135655 * A178501 A011557 A138825
Adjacent sequences: A178497 A178498 A178499 * A178501 A178502 A178503
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, May 28 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 July 17 04:55 EDT 2024. Contains 374360 sequences. (Running on oeis4.)