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.
%I A022359 #29 Aug 05 2024 05:18:30
%S A022359 0,25,25,50,75,125,200,325,525,850,1375,2225,3600,5825,9425,15250,
%T A022359 24675,39925,64600,104525,169125,273650,442775,716425,1159200,1875625,
%U A022359 3034825,4910450,7945275,12855725,20801000,33656725,54457725,88114450,142572175,230686625
%N A022359 Fibonacci sequence beginning 0, 25.
%H A022359 G. C. Greubel, <a href="/A022359/b022359.txt">Table of n, a(n) for n = 0..1000</a>
%H A022359 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022359 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022359 G.f.: 25*x/(1 - x - x^2). - _Philippe Deléham_, Nov 20 2008
%F A022359 a(n) = (-25/2)*(Fibonacci(n) - Lucas(n)). - _Harvey P. Dale_, Nov 22 2012
%F A022359 a(n) = Lucas(n+5) + Lucas(n-5), with Lucas(-i) = (-1)^i*Lucas(i) for the negative indices. - _Bruno Berselli_, Dec 27 2016
%t A022359 LinearRecurrence[{1, 1}, {0, 25}, 30] (* or *) Table[(-25/2)(Fibonacci[n] - LucasL[n]), {n, 50}] (* _Harvey P. Dale_, Nov 22 2012 *)
%o A022359 (Magma) [Lucas(n+5)+Lucas(n-5): n in [0..40]]; // _Bruno Berselli_, Dec 27 2016
%o A022359 (PARI) for(n=0,50, print1(25*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K A022359 nonn,easy
%O A022359 0,2
%A A022359 _N. J. A. Sloane_