login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002282 8*(10^n - 1)/9. 21
0, 8, 88, 888, 8888, 88888, 888888, 8888888, 88888888, 888888888, 8888888888, 88888888888, 888888888888, 8888888888888, 88888888888888, 888888888888888, 8888888888888888, 88888888888888888 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

If the initial term is omitted, might be called eightful (or hateful) numbers!

a(n) = A178635(n)/A002283(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 31 2010]

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 (paoloplava(AT)gmail.com), 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]

a(n)=a(n-1)+8*10^(n-1) with a(0)=0; [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jul 22 2010]

PROG

(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]

Cf. A002275, A002276, A002277, A002278, A002279, A002280, A002281, A059988, A075412. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 31 2010]

Sequence in context: A053378 A062185 A053379 * A112907 A053380 A115864

Adjacent sequences:  A002279 A002280 A002281 * A002283 A002284 A002285

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.