This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095940 a(n+2) = 5a(n+1) - 3a(n) (n >= 1); a(0) = 0, a(1) = 1, a(2) = 4. 2

%I

%S 0,1,4,17,73,314,1351,5813,25012,107621,463069,1992482,8573203,

%T 36888569,158723236,682950473,2938582657,12644061866,54404561359,

%U 234090621197,1007239421908,4333925245949,18647907964021,80237764082258

%N a(n+2) = 5a(n+1) - 3a(n) (n >= 1); a(0) = 0, a(1) = 1, a(2) = 4.

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

%F a(n)=(1/2)*[5/2-(1/2)*sqrt(13)]^n-(3/26)*[5/2-(1/2)*sqrt(13)]^n*sqrt(13)+(3/26)*sqrt(13)*[5/2+(1 /2)*sqrt(13)]^n+(1/2)*[5/2+(1/2)*sqrt(13)]^n+[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, Oct 02 2008]

%F G.f.: (x-x^2)/(3*x^2-5*x+1) [From Harvey P. Dale, Aug 20 2011]

%t Join[{0},LinearRecurrence[{5,-3},{1,4},30]] (* _Harvey P. Dale_, Aug 20 2011 *)

%Y Cf. A018902; equals A095934 - A095939.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, Jul 13 2004

%E Extended by _Ray Chandler_, Jul 16 2004

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

Last modified June 20 17:27 EDT 2019. Contains 324234 sequences. (Running on oeis4.)