login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139740 a(n) = 11^n - 2^n. 3
0, 9, 117, 1323, 14625, 161019, 1771497, 19487043, 214358625, 2357947179, 25937423577, 285311668563, 3138428372625, 34522712135739, 379749833566857, 4177248169382883, 45949729863506625, 505447028499162699, 5559917313491969337, 61159090448414022003 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
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
PROG
(Sage) [11^n - 2^n for n in range(0, 20)] # Zerinvary Lajos, Jun 05 2009
(Magma) [11^n-2^n: n in [0..30]]; // Vincenzo Librandi, Jun 02 2011
(PARI) a(n)=11^n-2^n \\ Charles R Greathouse IV, Mar 26 2012
(Python) [11**n-2**n for n in range(20)] # Gennady Eremin, Mar 05 2022
CROSSREFS
Cf. A016135.
Sequence in context: A253655 A092913 A022607 * A221442 A196663 A292843
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 20 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)