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

%I #12 May 09 2016 04:37:46

%S 1,1,0,2,5,12,22,43,84,170,341,684,1366,2731,5460,10922,21845,43692,

%T 87382,174763,349524,699050,1398101,2796204,5592406,11184811,22369620,

%U 44739242,89478485,178956972,357913942,715827883,1431655764,2863311530

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

%H G. C. Greubel, <a href="/A166249/b166249.txt">Table of n, a(n) for n = 0..1000</a>

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

%F From _R. J. Mathar_, Nov 09 2009: (Start)

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

%F a(n) = A001045(n) + A010892(n+1). (End)

%t LinearRecurrence[{2, 0, -1, 2}, {1, 1, 0, 2}, 100] (* _G. C. Greubel_, May 08 2016 *)

%K nonn,easy

%O 0,4

%A _Paul Curtz_, Oct 10 2009

%E Edited by _N. J. A. Sloane_, Oct 13 2009

%E Extended by _R. J. Mathar_, Nov 09 2009

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)