%I #73 Jan 01 2024 11:37:58
%S 5,10,25,65,170,445,1165,3050,7985,20905,54730,143285,375125,982090,
%T 2571145,6731345,17622890,46137325,120789085,316229930,827900705,
%U 2167472185,5674515850,14856075365,38893710245,101825055370,266581455865
%N Sum of two consecutive squares of Lucas numbers (A001254).
%C Positive values of x (or y) satisfying x^2 - 3xy + y^2 + 25 = 0. - _Colin Barker_, Feb 08 2014
%C Positive values of x (or y) satisfying x^2 - 7xy + y^2 + 225 = 0. - _Colin Barker_, Feb 09 2014
%C Positive values of x (or y) satisfying x^2 - 18xy + y^2 + 1600 = 0. - _Colin Barker_, Feb 26 2014
%H Bruno Berselli, <a href="/A106729/b106729.txt">Table of n, a(n) for n = 0..300</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1).
%F a(n) = Lucas(n)^2 + Lucas(n+1)^2 = 5*(Fibonacci(n)^2 + Fibonacci(n+1)^2) = 5*A001519(n+1).
%F a(n) = 3*a(n-1) - a(n-2). - _T. D. Noe_, Dec 11 2006
%F G.f.: 5*(1-x)/(1-3*x+x^2). - _Philippe Deléham_, Nov 16 2008
%F a(n) = Fibonacci(n-2)^2 + Fibonacci(n+3)^2. - _Gary Detlefs_, Dec 28 2010
%F a(n) = [1,1; 1,2]^(n-2).{3,4}.{3,4}, for n>=3. - _John M. Campbell_, Jul 09 2011
%F a(n) = Lucas(2n) + Lucas(2n+2). - _Richard R. Forberg_, Nov 23 2014
%F From _Robert Israel_, Nov 23 2014: (Start)
%F a(n) = 5*A000045(2*n+1).
%F E.g.f.: (5+sqrt(5))/2 * exp((3+sqrt(5))*x/2) + (5-sqrt(5))/2 * exp((3-sqrt(5))*x/2). (End)
%p seq(combinat:-fibonacci(n-2)^2 + combinat:-fibonacci(n+3)^2, n=0..100); # _Robert Israel_, Nov 23 2014
%t Table[LucasL[n]^2 + LucasL[n+1]^2, {n, 0, 30}] (* _Wesley Ivan Hurt_, Nov 23 2014 *)
%t Total/@Partition[LucasL[Range[0,30]]^2,2,1] (* _Harvey P. Dale_, Jun 26 2022 *)
%o (Magma) [Fibonacci(n-2)^2+Fibonacci(n+3)^2: n in [0..30]]; // _Vincenzo Librandi_, Jul 09 2011
%o (PARI) a(n) = fibonacci(n-2)^2 + fibonacci(n+3)^2;
%o vector(30, n, a(n-1)) \\ _G. C. Greubel_, Dec 17 2017
%o (Sage) [fibonacci(n-2)^2 + fibonacci(n+3)^2 for n in (0..30)] # _G. C. Greubel_, Sep 10 2021
%Y Cf. A000032, A000045, A000204, A001254.
%K nonn,easy
%O 0,1
%A _Lekraj Beedassy_, May 14 2005
%E Corrected by _T. D. Noe_, Dec 11 2006
%E More terms from _Bruno Berselli_, Jul 17 2011