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!)
A080882 a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=3, a(2)=7. 6

%I #14 Jun 15 2015 07:18:37

%S 1,3,7,22,52,164,388,1224,2896,9136,21616,68192,161344,508992,1204288,

%T 3799168,8988928,28357376,67094272,211662336,500798464,1579869184,

%U 3738010624,11792304128,27900891136,88018956288,208255086592

%N a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=3, a(2)=7.

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

%F a(n + 4) = 8*a(n + 2) - 4*a(n). - _Richard Choulet_, Dec 06 2008

%F a(n) = (7/24*3^(1/2) + 1/2)*((1 + sqrt(3)))^n + ( - 7/24*3^(1/2) + 1/2)*((1 - sqrt(3)))^n + ( - 1/24*3^(1/2))*( - (1 + sqrt(3)))^n + (1/24*3^(1/2))*( - ((1 - sqrt(3))))^n. - _Richard Choulet_, Dec 06 2008

%p a:= n-> (Matrix([[22,7,3,1]]). Matrix(4, (i,j)-> if (i=j-1) then 1 elif j=1 then [0,8,0,-4][i] else 0 fi)^(n))[1,4]: seq(a(n), n=0..26); # _Alois P. Heinz_, Aug 23 2008

%t a[0]=1; a[1]=3; a[2]=7; a[3]=22; a[n_] := a[n] = 8*a[n-2] - 4*a[n-4]; Table[a[n], {n, 0, 26}] (* _Jean-François Alcover_, Jun 15 2015, after _Richard Choulet_ *)

%Y Cf. A080876, A080877, A080878, A080879, A080880, A080881.

%Y a(2n)=A080879(2n+1)=A080876(2n+4)/4, a(2n+1)=A080879(2n+2)/2=A080876(2n+5)/4.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Feb 22 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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)