|
Search: id:A130716
|
|
|
| A130716 |
|
a(0)=a(1)=a(2)=1, a(n)=0 for n>2. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
With different signs this sequence is the convolutional inverse of the Fibonacci sequence: 1, -1, -1, 0, 0, ... - Tanya Khovanova (tanyakh(AT)yahoo.com), Jul 14 2007
Inverse binomial transform of A000124. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 13 2008
|
|
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 (ppl(AT)spl.at), Dec 19 2007
|
|
CROSSREFS
|
Adjacent sequences: A130713 A130714 A130715 this_sequence A130717 A130718 A130719
Sequence in context: A070178 A127254 A079054 this_sequence A014102 A014195 A014096
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Curtz (bpcrtz(AT)free.fr) and Tanya Khovanova (tanyakh(AT)yahoo.com), Jul 01 2007
|
|
|
Search completed in 0.002 seconds
|
