OFFSET
0,2
COMMENTS
"Inverted" Lucas numbers:
The g.f. is obtained inserting 1/x into the g.f. of Lucas sequence and dividing by x. The closed form is a(n)=(-1)^n*a^(n+1)+(-1)^n*b^(n+1), where a=golden ratio and b=1-a, so that a(n)=(-1)^n*L(n+1), L(n)=Lucas numbers.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (-1,1).
FORMULA
a(n) = -a(n-1)+a(n-2), a(0)=1, a(1)=-3.
a(n) = term (1,1) in the 1x2 matrix [1,-2] * [-1,1; 1,0]^n. - Alois P. Heinz, Jul 31 2008
E.g.f.: exp(-(1+sqrt(5))*x/2)*(3 + sqrt(5) - 2*exp(sqrt(5)*x))/(1 + sqrt(5)). - Stefano Spezia, Jan 12 2020
MAPLE
a:= n-> (Matrix([[1, -2]]). Matrix([[-1, 1], [1, 0]])^(n))[1, 1]:
seq(a(n), n=0..45); # Alois P. Heinz, Jul 31 2008
MATHEMATICA
CoefficientList[Series[(1 - 2z)/(1 + z - z^2), {z, 0, 40}], z]
PROG
(Haskell)
a075193 n = a075193_list !! n
a075193_list = 1 : -3 : zipWith (-) a075193_list (tail a075193_list)
-- Reinhard Zumkeller, Sep 15 2015
(Magma) R<x>:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (1-2*x)/(1+x-x^2))); // Marius A. Burtea, Jan 12 2020
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Mario Catalani (mario.catalani(AT)unito.it), Sep 07 2002
STATUS
approved