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!)
A081193 a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9. 1

%I #11 Sep 08 2022 08:45:09

%S 1,9,46,204,856,3504,14176,57024,228736,916224,3667456,14674944,

%T 58710016,234860544,939483136,3758014464,15032221696,60129214464,

%U 240517513216,962071363584,3848288075776,15393157545984,61572640669696

%N a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9.

%C Third binomial transform of A010687 (period 2: repeat 1,6). [_Bruno Berselli_, Aug 06 2013]

%H Vincenzo Librandi, <a href="/A081193/b081193.txt">Table of n, a(n) for n = 0..200</a>

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

%F G.f.: (1+3*x)/((1-2*x)*(1-4*x)).

%F a(n) = 7*4^n/2-5*2^n/2.

%t CoefficientList[Series[(1 + 3 x)/((1 - 2 x) (1 - 4 x)), {x, 0, 30}], x] (* _Vincenzo Librandi_, Aug 07 2013 *)

%o (Magma) [7*4^n/2-5*2^n/2: n in [0..25]]; // _Vincenzo Librandi_, Aug 07 2013

%K nonn,easy

%O 0,2

%A _Paul Barry_, Mar 11 2003

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