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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140966 (5+(-2)^n)/3. 6
2, 1, 3, -1, 7, -9, 23, -41, 87, -169, 343, -681, 1367, -2729, 5463, -10921, 21847, -43689, 87383, -174761, 349527, -699049, 1398103, -2796201, 5592407, -11184809, 22369623, -44739241, 89478487, -178956969, 357913943 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Inverse binomial transform of A048573.

This is an example of the case k= -1 of sequences with recurrences a(n)=k*a(n-1)+(k+3)*a(n-2)-(2k+2)*a(n-3).

The case k=1 is covered for example by A097163, A135520, A136326, A136336, or A137208.

Sequences with k=2 are A094554 and A094555.

Sequences with k=3 are A084175, A108924, and A139818.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index to sequences with recurrences with constant coefficients

FORMULA

a(n)=-a(n-1)+2*a(n-2).

G.f.: (2+3*x)/((1-x)*(1+2*x)).

a(n+1)-a(n) = (-1)^(n+1)*A000079(n).

a(n+3) = (-1)^n*A083582(n).

a(n+1) -2*a(n) = -a(n+2).

a(n+1) -3*a(n) = 5*(-1)^(n+1)*A078008(n) = (-1)^(n+1)*A001045(n-1).

PROG

(MAGMA) [( 5+(-2)^n)/3: n in [0..35]]; // Vincenzo Librandi, Jul 05 2011

CROSSREFS

Sequence in context: A191854 A129646 A165401 * A058036 A136179 A185176

Adjacent sequences:  A140963 A140964 A140965 * A140967 A140968 A140969

KEYWORD

sign,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jul 27 2008

EXTENSIONS

Definition simplified, sequence extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 2009

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 17 02:48 EST 2012. Contains 205978 sequences.