|
| |
|
|
A075193
|
|
"Inverted" Lucas numbers (see Comments).
|
|
5
| |
|
|
1, -3, 4, -7, 11, -18, 29, -47, 76, -123, 199, -322, 521, -843, 1364, -2207, 3571, -5778, 9349, -15127, 24476, -39603, 64079, -103682, 167761, -271443, 439204, -710647, 1149851, -1860498, 3010349, -4870847, 7881196, -12752043, 20633239, -33385282, 54018521, -87403803, 141422324
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| 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
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = -a(n-1)+a(n-2), a(0)=1, a(1)=-3. G.f.: (1-2x)/(1+x-x^2).
a(n) = term (1,1) in the 1x2 matrix [1,-2] * [-1,1; 1,0]^n. - Alois P. Heinz, Jul 31 2008
a(n) = A186679(n)+A186679(n-2) for n>1. [Reinhard Zumkeller, Feb 25 2011]
|
|
|
MAPLE
| a:= n-> (Matrix([[1, -2]]). Matrix([[-1, 1], [1, 0]])^(n))[1, 1]: seq (a(n), n=0..38); # Alois P. Heinz, Jul 31 2008
|
|
|
MATHEMATICA
| CoefficientList[Series[(1 - 2z)/(1 + z - z^2), {z, 0, 40}], z]
|
|
|
CROSSREFS
| Cf. A000032.
Sequence in context: A093090 A193686 A000204 * A042433 A024319 A041209
Adjacent sequences: A075190 A075191 A075192 * A075194 A075195 A075196
|
|
|
KEYWORD
| easy,sign
|
|
|
AUTHOR
| Mario Catalani (mario.catalani(AT)unito.it), Sep 07 2002
|
| |
|
|
