Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075193
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075193 "Inverted" Lucas numbers (see Comments). +0
4
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; listen)
OFFSET

0,2

COMMENT

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

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).

MATHEMATICA

CoefficientList[Series[(1 - 2z)/(1 + z - z^2), {z, 0, 40}], z]

CROSSREFS

Cf. A000032.

Adjacent sequences: A075190 A075191 A075192 this_sequence A075194 A075195 A075196

Sequence in context: A100581 A093090 A000204 this_sequence A042433 A024319 A041209

KEYWORD

easy,sign

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Sep 07 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 17 13:36 EDT 2008. Contains 139908 sequences.


AT&T Labs Research