The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A110807 n times largest n-digit number. 4
0, 9, 198, 2997, 39996, 499995, 5999994, 69999993, 799999992, 8999999991, 99999999990, 1099999999989, 11999999999988, 129999999999987, 1399999999999986, 14999999999999985, 159999999999999984 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = n*(10^n-1) = 9*A053422(n). - R. J. Mathar, Dec 04 2016
G.f.: -9*x*(-1+10*x^2) / ( (10*x-1)^2*(x-1)^2 ). - R. J. Mathar, Dec 04 2016
EXAMPLE
a(3) = 3*999 = 2997.
MATHEMATICA
Table[(10^n - 1)*n, {n, 1, 30}] (* Stefan Steinerberger *)
LinearRecurrence[{22, -141, 220, -100}, {0, 9, 198, 2997, 39996}, 20] (* Harvey P. Dale, Sep 22 2016 *)
PROG
(PARI) for(n=1, 25, print1(n*(10^n-1), ", ")) \\ G. C. Greubel, Oct 19 2017
(Magma) [n*(10^n-1): n in [1..25]]; // G. C. Greubel, Oct 19 2017
CROSSREFS
Sequence in context: A250401 A291974 A180778 * A019566 A338226 A157563
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Aug 14 2005
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 June 12 17:08 EDT 2024. Contains 373339 sequences. (Running on oeis4.)