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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166920 2^n -(1+(-1)^n)/2 . 4
0, 2, 3, 8, 15, 32, 63, 128, 255, 512, 1023, 2048, 4095, 8192, 16383, 32768, 65535, 131072, 262143, 524288, 1048575, 2097152, 4194303, 8388608, 16777215, 33554432, 67108863, 134217728, 268435455, 536870912, 1073741823, 2147483648, 4294967295 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Partial sums of A014551. The inverse binomial transform yields a sequence 0,2,-1,5,-7,17,...: zero followed by a sign alternating A014551.

The table of a(n) plus higher order differences in successive rows shows A131577 on the main diagonal.

LINKS

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

Index to sequences with homogeneous linear recurrences with constant coefficients, signature (2,1,-2)

FORMULA

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

a(n) = 2^n - (1+(-1)^n)/2.

a(2*n) = A024036(n); a(2*n+1)= A004171(n).

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

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

a(n) = A000225(n+1)-A051049(n) = A014551(n)-A168361(n).

PROG

(MAGMA) [2^n -(1+(-1)^n)/2: n in [0..30]]; // Vincenzo Librandi, May 16 2011

CROSSREFS

Sequence in context: A128022 A011946 A195095 * A080206 A132862 A055543

Adjacent sequences:  A166917 A166918 A166919 * A166921 A166922 A166923

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 23 2009

EXTENSIONS

Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 02 2010

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 14:37 EST 2012. Contains 205930 sequences.