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.

A139740 a(n) = 11^n - 2^n.

Original entry on oeis.org

0, 9, 117, 1323, 14625, 161019, 1771497, 19487043, 214358625, 2357947179, 25937423577, 285311668563, 3138428372625, 34522712135739, 379749833566857, 4177248169382883, 45949729863506625, 505447028499162699, 5559917313491969337, 61159090448414022003, 672749994932558960625
Offset: 0

Views

Author

N. J. A. Sloane, May 20 2008

Keywords

Crossrefs

Programs

Formula

a(n) = 13*a(n-1) - 22*a(n-2). - Vincenzo Librandi, Jun 02 2011
a(n) = A001020(n) - A000079(n). - Michel Marcus, Feb 28 2022
a(n) = 9*A016135(n-1), n > 0. - Bernard Schott, Mar 09 2022
E.g.f.: exp(2*x)*(exp(9*x) - 1). - Stefano Spezia, Mar 09 2025
G.f.: 9*x/((1-2*x)*(1-11*x)). - Elmo R. Oliveira, Mar 15 2025