login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073845 a(1)=a(2)=1, a(n+2)=a(n+1)+a(n)+(-2)^n. 0
1, 1, 0, 5, -3, 18, -17, 65, -80, 241, -351, 914, -1485, 3525, -6152, 13757, -25163, 54130, -102105, 214169, -412224, 850521, -1658855, 3385970, -6661493, 13501693, -26714232, 53896325, -107035635, 215296146, -428610401, 860427569, -1715666480, 3439728385, -6865872687 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..35.

Index entries for linear recurrences with constant coefficients, signature (-1,3,2).

FORMULA

For n>3, a(n) = (-1)^n*floor{(1/5)*( 2^n + (2*sqrt(5)-3)*(-phi)^n) } where phi is the golden ratio = (1+sqrt(5))/2

a(1)=1, a(2)=1, a(3)=0, a(n)=a(n-1)+3*a(n-2)+2*a (n-3). - Harvey P. Dale, Oct 15 2015

G.f.: x*(-1-2*x+2*x^2) / ( (2*x+1)*(x^2+x-1) ). - R. J. Mathar, Nov 07 2015

MATHEMATICA

RecurrenceTable[{a[1]==a[2]==1, a[n+2]==a[n+1]+a[n]+(-2)^n}, a, {n, 40}] (* or *) LinearRecurrence[{-1, 3, 2}, {1, 1, 0}, 40] (* Harvey P. Dale, Oct 15 2015 *)

CROSSREFS

Sequence in context: A133172 A075453 A349118 * A169697 A092525 A101367

Adjacent sequences: A073842 A073843 A073844 * A073846 A073847 A073848

KEYWORD

sign,easy

AUTHOR

Benoit Cloitre, Sep 02 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 11:50 EST 2022. Contains 358632 sequences. (Running on oeis4.)