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 A022363 #27 May 12 2023 15:03:00
%S A022363 0,29,29,58,87,145,232,377,609,986,1595,2581,4176,6757,10933,17690,
%T A022363 28623,46313,74936,121249,196185,317434,513619,831053,1344672,2175725,
%U A022363 3520397,5696122,9216519,14912641,24129160,39041801,63170961,102212762,165383723
%N A022363 Fibonacci sequence beginning 0, 29.
%H A022363 G. C. Greubel, <a href="/A022363/b022363.txt">Table of n, a(n) for n = 0..1000</a>
%H A022363 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022363 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022363 G.f.: 29*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022363 a(n) = Fibonacci(n+7) - Fibonacci(n-7), where Fibonacci(-7..-1) = 13, -8, 5, -3, 2, -1, 1. - _Bruno Berselli_, May 22 2015
%F A022363 a(n) = a(n-1) + a(n-2) for n>=2, with a(0)=0, a(1)=29. - _Wesley Ivan Hurt_, May 12 2023
%t A022363 Table[29 Fibonacci(n), {n, 0, 40}] (* _Bruno Berselli_, May 22 2015 *)
%t A022363 LinearRecurrence[{1,1},{0,29},40] (* _Harvey P. Dale_, Feb 13 2023 *)
%o A022363 (Magma) [29*Fibonacci(n): n in [0..40]]; // _Bruno Berselli_, May 22 2015
%o A022363 (PARI) for(n=0,50, print1(29*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%Y A022363 Cf. A000045.
%Y A022363 Cf. similar sequences listed in A258160.
%K A022363 nonn,easy
%O A022363 0,2
%A A022363 _N. J. A. Sloane_
%E A022363 More terms from _Bruno Berselli_, May 22 2015