Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135575
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135575 a(n) = A135574(n+1)-2*A135574(n). +0
3
0, 3, -5, 9, -16, 30, -63, 129, -257, 513, -1024, 2046, -4095, 8193, -16385, 32769, -65536, 131070, -262143, 524289, -1048577, 2097153, -4194304, 8388606, -16777215, 33554433, -67108865, 134217729, -268435456, 536870910, -1073741823, 2147483649, -4294967297, 8589934593 (list; graph; listen)
OFFSET

0,2

MAPLE

A024495 := proc(n) option remember ; if n <=1 then 0 ; elif n = 2 then 1; elif n = 3 then 3 ; else A024495(n-1)-A024495(n-2)+2^(n-2) ; fi ; end: A135574 := proc(n) option remember ; A024495(2*floor(n/2)+1 - ( n mod 2)) ; end: A135575 := proc(n) A135574(n+1)-2*A135574(n) ; end: seq(A135575(n), n=0..80) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 31 2008

CROSSREFS

Adjacent sequences: A135572 A135573 A135574 this_sequence A135576 A135577 A135578

Sequence in context: A094980 A069818 A054180 this_sequence A143106 A130114 A143105

KEYWORD

sign,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Feb 24 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 31 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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research