cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A173810 a(n) = (8*10^n - 71)/9 for n > 0.

Original entry on oeis.org

1, 81, 881, 8881, 88881, 888881, 8888881, 88888881, 888888881, 8888888881, 88888888881, 888888888881, 8888888888881, 88888888888881, 888888888888881, 8888888888888881, 88888888888888881, 888888888888888881, 8888888888888888881, 88888888888888888881, 888888888888888888881
Offset: 1

Views

Author

Vincenzo Librandi, Feb 25 2010

Keywords

Crossrefs

Cf. A092675.

Programs

Formula

a(n) = 10*a(n-1) + 71 for n > 0, a(0) = -7.
From Vincenzo Librandi, Jul 05 2012: (Start)
G.f.: x*(1+70*x)/((1-x)*(1-10*x)).
a(n) = 11*a(n-1) - 10*a(n-2). (End)
E.g.f.: exp(x)*(8*exp(9*x) - 71)/9. - Elmo R. Oliveira, Sep 09 2024