cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A214885 a(n) = Sum_{k=0..n} (-1)^k*F(k)*F(k+3), where F=A000045 (Fibonacci numbers).

This page as a plain text file.
%I A214885 #19 Aug 26 2017 09:11:38
%S A214885 0,-3,2,-14,25,-80,192,-523,1346,-3550,9265,-24288,63552,-166419,
%T A214885 435650,-1140590,2986057,-7817648,20466816,-53582875,140281730,
%U A214885 -367262398,961505377,-2517253824,6590256000,-17253514275,45170286722,-118257345998
%N A214885 a(n) = Sum_{k=0..n} (-1)^k*F(k)*F(k+3), where F=A000045 (Fibonacci numbers).
%C A214885 This is the m=3 member of the m-family b(m,n) given in a comment on A214884, where also the formula and the o.g.f. are found.
%F A214885 a(n) =  b(3,n) = 2*A119283(n)  + (-1)^n*A001654(n), n >= 0.
%F A214885 O.g.f.: A(3,x) = -x*(3+x)/((1-x)^2*(1+3*x+x^2)). See the comment above.
%F A214885 a(n) = ((-1)^n*Fibonacci(2*n + 4) - 4*n - 3)/5. - _Ehren Metcalfe_, Aug 21 2017
%t A214885 Table[Sum[(-1)^k*Fibonacci[k]*Fibonacci[k + 3], {k, 0, n}], {n, 0, 27}] (* _Michael De Vlieger_, Aug 23 2017 *)
%Y A214885 Cf. A119283, -A077916(n-1), A214884.
%K A214885 sign,easy
%O A214885 0,2
%A A214885 _Wolfdieter Lang_, Jul 30 2012