A110807 n times largest n-digit number.

0, 9, 198, 2997, 39996, 499995, 5999994, 69999993, 799999992, 8999999991, 99999999990, 1099999999989, 11999999999988, 129999999999987, 1399999999999986, 14999999999999985, 159999999999999984

Offset

0,2

Links

G. C. Greubel, Table of n, a(n) for n = 0..990

Index entries for linear recurrences with constant coefficients, signature (22,-141,220,-100).

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

Adjacent sequences: A110804 A110805 A110806 * A110808 A110809 A110810

Keyword

base,easy,nonn

Author

Amarnath Murthy, Aug 14 2005

Status

approved