Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152163
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152163 a(n)=a(n-1)+a(n-2), n>1 ; a(0)=1, a(1)=-1 . +0
8
1, -1, 0, -1, -1, -2, -3, -5, -8, -13, -21, -34, -55, -89, -144, -233, -377, -610, -987, -1597, -2584, -4181, -6765, -10946, -17711, -28657, -46368, -75025, -121393, -196418, -317811, -514229, -832040, -1346269, -2178309, -3524578, -5702887 (list; graph; listen)
OFFSET

0,6

FORMULA

G.f.: (1-2*x)/(1-x-x^2). a(n)=Sum_{k, 0<=k<=n}A147703(n,k)*(-2)^k. a(n)=-Fibonacci(n-2) for n>=2 .

a(n)=(1/2)*{[(1/2)+(1/2)*sqrt(5)]^n+[(1/2)-(1/2)*sqrt(5)]^n}+(3/10)*sqrt(5)*{[(1/2)-(1/2) *sqrt(5)]^n-[(1/2)+(1/2)*sqrt(5)]^n}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Dec 01 2008]

CROSSREFS

Cf. A000045

Sequence in context: A000044 A107358 A132636 this_sequence A039834 A000045 A020695

Adjacent sequences: A152160 A152161 A152162 this_sequence A152164 A152165 A152166

KEYWORD

easy,sign

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 27 2008

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research