OFFSET
0,5
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1, 0, -2).
FORMULA
a(n) = a(n-1) - 2*a(n-3), where a(0)=1, a(1)=1, a(2)=1. - Sergei N. Gladkovskii, Aug 21 2012
a(n) = (-1)^n * A077973(n). - Ralf Stephan, Aug 18 2013
G.f.: G(0)/(2*(1-x^2)), where G(k)= 1 + 1/(1 - x*(k+1)/(x*(k+2) + 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 25 2013
a(n) = Sum_{k=1..floor((n+2)/2)} binomial(n+2-2*k, k-1)*(-2)^(k-1). - Taras Goy, Sep 18 2019
MATHEMATICA
CoefficientList[Series[1/(1-x+2x^3), {x, 0, 50}], x] (* or *) LinearRecurrence[ {1, 0, -2}, {1, 1, 1}, 50] (* Harvey P. Dale, Oct 18 2013 *)
PROG
(PARI) Vec(1/(1-x+2*x^3)+O(x^50)) \\ Charles R Greathouse IV, Sep 26 2012
(Magma) R<x>:=PowerSeriesRing(Integers(), 50); Coefficients(R!( 1/(1-x+2*x^3) )); // G. C. Greubel, Jul 03 2019
(Sage) (1/(1-x+2*x^3)).series(x, 50).coefficients(x, sparse=False) # G. C. Greubel, Jul 03 2019
(GAP) a:=[1, 1, 1];; for n in [4..50] do a[n]:= a[n-1]-2*a[n-3]; od; a; # G. C. Greubel, Jul 03 2019
CROSSREFS
KEYWORD
sign,easy
AUTHOR
N. J. A. Sloane, Nov 17 2002, Jun 17 2007
STATUS
approved