Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051792
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051792 a(n)=(-1)^(n-1)*a(n-1)+(-1)^(n-2)*a(n-2), a(1)=1,a(2)=1. +0
4
1, 1, 0, 1, 1, 0, -1, 1, 2, -1, -3, 2, 5, -3, -8, 5, 13, -8, -21, 13, 34, -21, -55, 34, 89, -55, -144, 89, 233, -144, -377, 233, 610, -377, -987, 610, 1597, -987, -2584, 1597, 4181, -2584, -6765, 4181, 10946, -6765, -17711, 10946, 28657, -17711, -46368 (list; graph; listen)
OFFSET

1,9

FORMULA

G.f.: (x+x^2+x^3+2*x^4)/(1+x^2-x^4). a(n)=-a(n-2)+a(n-4) - Michael Somos.

PROGRAM

(PARI) a(n)=fibonacci((3-n)\2+(3-n)%2*2)

CROSSREFS

a(3-n)=A053602(n). Cf. A000045.

Sequence in context: A008731 A114209 A132091 this_sequence A053602 A123231 A058736

Adjacent sequences: A051789 A051790 A051791 this_sequence A051793 A051794 A051795

KEYWORD

easy,sign

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 10 1999

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research