|
| |
|
|
A130716
|
|
a(0)=a(1)=a(2)=1, a(n)=0 for n>2.
|
|
6
|
|
|
|
1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
With different signs this sequence is the convolutional inverse of the Fibonacci sequence: 1, -1, -1, 0, 0, ... - Tanya Khovanova, Jul 14 2007
Inverse binomial transform of A000124. - R. J. Mathar, Jun 13 2008
|
|
|
LINKS
|
Table of n, a(n) for n=0..104.
|
|
|
FORMULA
|
G.f.: 1+x+x^2.
a(n)=[C((n+2)^2,n+4) mod 2]+[C((n+1)^2,n+3) mod 2]+[C(n^2,n+2) mod 2] - Paolo P. Lava, Dec 19 2007
|
|
|
CROSSREFS
|
Sequence in context: A070178 A127254 A212312 * A014102 A014195 A014096
Adjacent sequences: A130713 A130714 A130715 * A130717 A130718 A130719
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
Paul Curtz and Tanya Khovanova, Jul 01 2007
|
|
|
EXTENSIONS
|
a(n) = partial sums of sequence 1,0,0,-1,0,0,0,... for n >= 0. Partial sums of a(n) = A158799(n). [From Jaroslav Krizek, Dec 06 2009]
|
|
|
STATUS
|
approved
|
| |
|
|
