OFFSET
0,2
COMMENTS
If the initial term is omitted, might be called eightful (or hateful) numbers!
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (11,-10).
FORMULA
From Jaume Oliver Lafont, Feb 03 2009: (Start)
a(n) = 11a(n-1) - 10a(n-2), with a(0)=0, a(1)=8.
G.f.: 8x/((1-x)(1-10x)). (End)
a(n) = a(n-1) + 8*10^(n-1), with a(0)=0. - Vincenzo Librandi, Jul 22 2010
From Ilya Gutkovskiy, Sep 03 2016: (Start)
E.g.f.: 8*(exp(9*x) - 1)*exp(x)/9.
a(n) = floor(8*10^n/9). (End)
EXAMPLE
Curious multiplications:
9*9 + 7 = 88;
98*9 + 6 = 888;
987*9 + 5 = 8888;
9876*9 + 4 = 88888;
98765*9 + 3 = 888888;
987654*9 + 2 = 8888888;
9876543*9 + 1 = 88888888;
98765432*9 + 0 = 888888888;
987654321*9 - 1 = 8888888888;
9876543210*9 - 2 = 88888888888. - Philippe Deléham, Mar 09 2014
MAPLE
MATHEMATICA
LinearRecurrence[{11, -10}, {0, 8}, 20] (* Harvey P. Dale, May 30 2013 *)
PROG
(PARI) { a=-4/5; for (n = 0, 200, a+=8*10^(n - 1); write("b002282.txt", n, " ", a); ) } \\ Harry J. Smith, Jun 27 2009
(Python) def a(n): return int(8*(10**n - 1)/9) # Martin Gergov, Oct 19 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
STATUS
approved