|
Search: id:A122803
|
|
| |
|
| 1, -2, 4, -8, 16, -32, 64, -128, 256, -512, 1024, -2048, 4096, -8192, 16384, -32768, 65536, -131072, 262144, -524288, 1048576, -2097152, 4194304, -8388608, 16777216, -33554432, 67108864, -134217728, 268435456, -536870912, 1073741824, -2147483648, 4294967296
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Franklin T. Adams-Watters, Table of n, (-2)^n for n = 0..1000
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = (-2)^n.
a(n) = - 4a(n-1) - 4a(n-2). - Tanya Khovanova (tanyakh(AT)yahoo.com), Feb 01 2007
|
|
MAPLE
|
a:=n->mul(-2, k=0..n): seq(a(n), n=-1..31); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 22 2008
|
|
CROSSREFS
|
Cf. A000079 (powers of 2).
Adjacent sequences: A122800 A122801 A122802 this_sequence A122804 A122805 A122806
Sequence in context: A131577 A141531 A084633 this_sequence A000079 A120617 A050732
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 11 2006
|
|
|
Search completed in 0.002 seconds
|
