|
Search: id:A002282
|
|
| |
|
| 0, 8, 88, 888, 8888, 88888, 888888, 8888888, 88888888, 888888888, 8888888888, 88888888888, 888888888888, 8888888888888, 88888888888888, 888888888888888, 8888888888888888, 88888888888888888
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
If the initial term is omitted, might be called eightful (or hateful) numbers!
88=9*9+7; 888=98*9+6; 8888=987*9+5; 88888=9876*9+4; 888888=98765*9+3; 8888888=987654*9+2; 88888888=9876543*9+1; 888888888=98765432*9+0. [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jan 17 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,200
|
|
FORMULA
|
a(n)=10*a(n-1)+8, with a(0)=0 [From Paolo P. Lava (ppl(AT)spl.at), Jan 23 2009]
a(n)=11a(n-1)-10a(n-2), with a(0)=0 and a(1)=8. [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Feb 03 2009]
G.f.: 8x/((1-x)(1-10x)) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Feb 03 2009]
|
|
PROGRAM
|
(PARI) { a=-4/5; for (n = 0, 200, a+=8*10^(n - 1); write("b002282.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 27 2009]
|
|
CROSSREFS
|
Cf. A051003.
Cf. A059482 [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 27 2009]
Sequence in context: A053378 A062185 A053379 this_sequence A112907 A053380 A115864
Adjacent sequences: A002279 A002280 A002281 this_sequence A002283 A002284 A002285
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|