|
| |
|
|
A164267
|
|
A Fibonacci convolution.
|
|
0
| |
|
|
0, 1, 2, 7, 16, 46, 114, 309, 792, 2101, 5456, 14356, 37468, 98281, 256998, 673323, 1761984, 4614226, 12078110, 31624285, 82787980, 216750601, 567446112, 1485616392, 3889356696, 10182528721, 26658108074, 69791991919, 182717549872
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| G.f.: x/((1+x-x^2)(1-3x+x^2));
a(n)=sum{k=0..n, (-1)^k*F(k+1)*F(2(n-k))};
a(n)=sum{k=0..n, C(n,k)*F(k+1)*(1-(-1)^(n-k))/2};
a(n)=2a(n-1)+3a(n-2)-4a(n-3)+a(n-4).
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (2,3,-4,1)
|
|
|
FORMULA
| a(n)= (A122367(n)-A039834(n-1))/2. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2009]
|
|
|
MATHEMATICA
| LinearRecurrence[{2, 3, -4, 1}, {0, 1, 2, 7}, 30] (* From Harvey P. Dale, Jul 12 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A178945 A026571 A100099 * A184352 A000512 A084079
Adjacent sequences: A164264 A164265 A164266 * A164268 A164269 A164270
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Paul Barry (pbarry(AT)wit.ie), Aug 11 2009
|
| |
|
|