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

%I #33 Mar 09 2022 21:15:03

%S 0,9,117,1323,14625,161019,1771497,19487043,214358625,2357947179,

%T 25937423577,285311668563,3138428372625,34522712135739,

%U 379749833566857,4177248169382883,45949729863506625,505447028499162699,5559917313491969337,61159090448414022003

%N a(n) = 11^n - 2^n.

%H Vincenzo Librandi, <a href="/A139740/b139740.txt">Table of n, a(n) for n = 0..300</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (13,-22).

%F a(n) = 13*a(n-1) - 22*a(n-2). - _Vincenzo Librandi_, Jun 02 2011

%F a(n) = A001020(n) - A000079(n). - _Michel Marcus_, Feb 28 2022

%F a(n) = 9 * A016135(n-1), n > 0. - _Bernard Schott_, Mar 09 2022

%o (Sage) [11^n - 2^n for n in range(0,20)] # _Zerinvary Lajos_, Jun 05 2009

%o (Magma) [11^n-2^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 02 2011

%o (PARI) a(n)=11^n-2^n \\ _Charles R Greathouse IV_, Mar 26 2012

%o (Python) [11**n-2**n for n in range(20)] # _Gennady Eremin_, Mar 05 2022

%Y Cf. A016135.

%Y Cf. A000079, A001020.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, May 20 2008

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 07:01 EDT 2024. Contains 371920 sequences. (Running on oeis4.)