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!)
A136336 a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n>3. 2

%I #12 Jan 14 2019 18:04:23

%S 1,2,4,7,15,27,59,107,235,427,939,1707,3755,6827,15019,27307,60075,

%T 109227,240299,436907,961195,1747627,3844779,6990507,15379115,

%U 27962027,61516459,111848107,246065835,447392427,984263339,1789569707,3937053355,7158278827

%N a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n>3.

%H Colin Barker, <a href="/A136336/b136336.txt">Table of n, a(n) for n = 0..1000</a>

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

%F From _Colin Barker_, Mar 17 2017: (Start)

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

%F a(n) = (8 + (-2)^n + 21*2^n) / 24 for n>0.

%F (End)

%t LinearRecurrence[{1,4,-4},{1,2,4,7},50] (* _Harvey P. Dale_, Jan 14 2019 *)

%o (PARI) Vec((1 + x - 2*x^2 - x^3) / ((1 - x)*(1 - 2*x)*(1 + 2*x)) + O(x^50)) \\ _Colin Barker_, Mar 17 2017

%K nonn,easy

%O 0,2

%A _Paul Curtz_, Mar 28 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 16 00:26 EDT 2024. Contains 371696 sequences. (Running on oeis4.)