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.

A103434 a(n) = Sum_{i=1..n} Fibonacci(2i)^2.

This page as a plain text file.
%I A103434 #21 Sep 08 2022 08:45:16
%S A103434 0,1,10,74,515,3540,24276,166405,1140574,7817630,53582855,367262376,
%T A103434 2517253800,17253514249,118257345970,810547907570,5555578007051,
%U A103434 38078498141820,260993908985724,1788878864758285,12261158144322310
%N A103434 a(n) = Sum_{i=1..n} Fibonacci(2i)^2.
%H A103434 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (9, -16, 9, -1).
%F A103434 G.f.: x(1+x) / ((1-7x+x^2)(1-x)^2).
%F A103434 a(n) = (1/5)*(Fibonacci(4n+2) - 2n - 1).
%F A103434 a(n) = Sum_{i=0..2n} (-1)^i*Fibonacci(i)*Fibonacci(i+1). - _Rigoberto Florez_, May 04 2019
%t A103434 Accumulate[Fibonacci[Range[0,40,2]]^2] (* _Harvey P. Dale_, Nov 14 2013 *)
%t A103434 LinearRecurrence[{9, -16, 9, -1},{0, 1, 10, 74},21] (* _Ray Chandler_, Sep 23 2015 *)
%o A103434 (Magma) [(1/5)*(Fibonacci(4*n+2)-2*n-1): n in [0..50]]; // _Vincenzo Librandi_, Apr 20 2011
%Y A103434 Partial sums of A049684.
%Y A103434 Bisection of A002571 and |A077916|.
%Y A103434 Cf. A000045.
%K A103434 nonn,easy
%O A103434 0,3
%A A103434 _Ralf Stephan_, Feb 08 2005