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 A099100 #38 Dec 31 2023 10:18:00
%S A099100 1,8,89,987,10946,121393,1346269,14930352,165580141,1836311903,
%T A099100 20365011074,225851433717,2504730781961,27777890035288,
%U A099100 308061521170129,3416454622906707,37889062373143906,420196140727489673,4660046610375530309,51680708854858323072,573147844013817084101,6356306993006846248183
%N A099100 a(n) = Fibonacci(5*n+1).
%H A099100 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A099100 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,1).
%F A099100 G.f.: (1 - 3*x)/(1 - 11*x - x^2);
%F A099100 a(n) = 11*a(n-1) + a(n-2). [corrected by _Philippe Deléham_, Nov 16 2008]
%F A099100 a(n) = Sum_{k=0..5*n} binomial(k, 5*n-k).
%F A099100 2*a(n) = Fibonacci(5*n) + Lucas(5*n). - _Bruno Berselli_, Oct 13 2017
%p A099100 with(combinat): A099100:=n->fibonacci(5*n+1): seq(A099100(n), n=0..20); # _Wesley Ivan Hurt_, Nov 18 2014
%t A099100 Fibonacci/@(5*Range[0,30]+1) (* _Vladimir Joseph Stephan Orlovsky_, Mar 01 2010 *)
%o A099100 (Magma) [Fibonacci(5*n+1): n in [0..100]]; // _Vincenzo Librandi_, Apr 16 2011
%o A099100 (PARI) a(n)=fibonacci(5*n+1) \\ _Charles R Greathouse IV_, Sep 28 2015
%Y A099100 Cf. A000032, A000045.
%K A099100 nonn,easy
%O A099100 0,2
%A A099100 _Paul Barry_, Sep 29 2004