login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141577 Alternating difference recursion: a(0) = -1; a(1) = 0; a(2) = 1; a(3) = -1; a(n)=a(n-1)-3*a(n-2)+3*a(n-3)-a(n-4). 0
-1, 0, 1, -1, -3, 3, 8, -9, -21, 27, 55, -80, -143, 235, 369, -685, -944, 1983, 2391, -5705, -5985, 16320, 14769, -46441, -35803, 131507, 84824, -370665, -194813, 1040147, 427767, -2906448, -874495, 8088003, 1564377, -22416669, -1971296, 61883839, -1016657, -170165393, 20507391, 466069760 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

REFERENCES

Martin Gardner, Mathematical Circus,Randon House, New York, 1981, p. 165

http://math.fullerton.edu/mathews/software/Matlab2004.zip

FORMULA

O.g.f.: (-1+x-2x^2+x^3)/(1-x+3x^2-3x^3+x^4). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 25 2008

CROSSREFS

Sequence in context: A022663 A092481 A099508 * A123315 A052407 A105039

Adjacent sequences:  A141574 A141575 A141576 * A141578 A141579 A141580

KEYWORD

sign

AUTHOR

Matt Wynne (mattwyn(AT)verizon.net), Aug 18 2008

EXTENSIONS

Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 25 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:10 EST 2012. Contains 205938 sequences.