|
Search: id:A008346
|
|
|
| A008346 |
|
Fibonacci(n) + (-1)^n. |
|
+0
13
|
|
| 1, 0, 2, 1, 4, 4, 9, 12, 22, 33, 56, 88, 145, 232, 378, 609, 988, 1596, 2585, 4180, 6766, 10945, 17712, 28656, 46369, 75024, 121394, 196417, 317812, 514228, 832041, 1346268, 2178310, 3524577
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Diagonal sums of A059260. - Paul Barry (pbarry(AT)wit.ie), Oct 25 2004
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 445
|
|
FORMULA
|
G.f.: 1/(1-2*x^2-x^3). a(n) = 2a(n-2) + a(n-3).
a(n)=sum{k=0..floor(n/2), sum{j=0..n-k, (-1)^(n-k-j)binomial(j, k)}}. Diagonal sums of A059260. - Paul Barry (pbarry(AT)wit.ie), Sep 23 2004
a(n)=sum{k=0..floor(n/2), binomial(k, n-2k)2^(3k-n)}; a(n)=sum{k=0..floor(n/2), binomial(k, n-2k)2^k(1/2)^(n-2k)}. - Paul Barry (pbarry(AT)wit.ie), Oct 04 2004
G.f. : 1/((1+x)(1-x-x^2); a(n)=sum{k=0..n, binomial(n-k-1, k)}. - Paul Barry (pbarry(AT)wit.ie), Oct 25 2004
|
|
MAPLE
|
with(combinat): f := n->fibonacci(n)+(-1)^n;
|
|
CROSSREFS
|
Cf. A007492, A066983, A078024.
Adjacent sequences: A008343 A008344 A008345 this_sequence A008347 A008348 A008349
Sequence in context: A060723 A074763 A099932 this_sequence A119282 A095293 A034409
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
