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!)
A105576 a(n) = 2*a(n-1) - 3*a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 4, a(2) = 0. 0

%I #17 Mar 07 2024 16:02:08

%S 3,4,0,-6,-4,10,20,2,-36,-38,36,114,44,-182,-268,98,636,442,-828,

%T -1710,-52,3370,3476,-3262,-10212,-3686,16740,24114,-9364,-57590,

%U -38860,76322,154044,1402,-306684,-309486,303884,922858,315092,-1530622,-2160804,900442,5222052,3421170

%N a(n) = 2*a(n-1) - 3*a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 4, a(2) = 0.

%C Floretion Algebra Multiplication Program, FAMP Code: 1vesseq[.5'j + .5'k + .5j' + .5k' + .5'ii' + .5e]

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

%F 2*a(n) = A105225(n) + A105577(n) + 4*((-1)^n)*A001607(n+1)

%F G.f.: (3-2x+x^2)/((1-x)(1-x+2x^2)). a(n)=1+A107920(n)+2*A107920(n+1). [From _R. J. Mathar_, Feb 04 2009]

%t LinearRecurrence[{2,-3,2},{3,4,0},50] (* _Harvey P. Dale_, Jul 05 2022 *)

%Y Cf. A105577, A105578, A105579, A105580.

%Y Equals 2*A107920(n) + A107920(n-1) + 1.

%K sign,easy

%O 0,1

%A _Creighton Dement_, Apr 14 2005

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)