|
Search: id:A165326
|
|
|
| A165326 |
|
a(0)=a(1)=1, a(n)=-a(n-1) for n>1. |
|
+0
3
|
|
| 1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Inverse binomial transform of A040000(n) = 1,2,2,2,2,... ; binomial transform of (-1)^(n+1)*A000918(n) = 1,0,-2,6,-14,30,-62,... [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 16 2009]
|
|
FORMULA
|
G.f.: (1+2x)/(1+x). E.g.f.: 2-exp(-x).
a(n)=(-1)^(n+1)+2*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Sep 16 2009]
|
|
CROSSREFS
|
Cf. A033999
Sequence in context: A034947 A097807 A014077 this_sequence A143621 A098417 A143622
Adjacent sequences: A165323 A165324 A165325 this_sequence A165327 A165328 A165329
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 14 2009
|
|
|
Search completed in 0.002 seconds
|
