|
|
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
|
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
|
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
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|