Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140683
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140683 3*(-1)^(n+1)*2^n-1. +0
1
-4, 5, -13, 23, -49, 95, -193, 383, -769, 1535, -3073, 6143, -12289, 24575, -49153, 98303, -196609, 393215, -786433, 1572863, -3145729, 6291455, -12582913, 25165823, -50331649, 100663295, -201326593, 402653183, -805306369, 1610612735, -3221225473 (list; graph; listen)
OFFSET

0,1

COMMENT

Alternated reading of negative of A140660 and A140529.

The binomial transform yields -4 followed by the negative of A140657.

The inverse binomial transform yields essentially a signed version of A000244. - R. J. Mathar, Aug 02 2008.

FORMULA

a(2n)= -A140660(n). a(2n+1)= A140529(n).

a(n+1)-a(n)= (-1)^n*A005010(n). a(2n)+a(2n+1)= A096045(n).

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

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

CROSSREFS

Sequence in context: A094029 A005672 A147001 this_sequence A071341 A102981 A029663

Adjacent sequences: A140680 A140681 A140682 this_sequence A140684 A140685 A140686

KEYWORD

sign

AUTHOR

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

EXTENSIONS

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

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research