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.

A171513 1+8*10^n+100^n.

Original entry on oeis.org

10, 181, 10801, 1008001, 100080001, 10000800001, 1000008000001, 100000080000001, 10000000800000001, 1000000008000000001, 100000000080000000001, 10000000000800000000001
Offset: 0

Views

Author

Jason Earls, Dec 10 2009

Keywords

Formula

From Chai Wah Wu, May 30 2016: (Start)
a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.
G.f.: (1810*x^2 - 929*x + 10)/((1 - x)*(1 - 10*x)*(1 - 100*x)). (End)
E.g.f.: (1 + 8*exp(9*x) + exp(99*x))*exp(x). - Ilya Gutkovskiy, May 30 2016