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 A167616 #35 Mar 24 2025 13:49:46
%S A167616 0,3,8,16,29,50,84,139,228,372,605,982,1592,2579,4176,6760,10941,
%T A167616 17706,28652,46363,75020,121388,196413,317806,514224,832035,1346264,
%U A167616 2178304,3524573,5702882,9227460,14930347,24157812,39088164,63245981,102334150
%N A167616 a(n) = Fibonacci(n) - 5.
%H A167616 G. C. Greubel, <a href="/A167616/b167616.txt">Table of n, a(n) for n = 5..1000</a>
%H A167616 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1).
%F A167616 a(n) = a(n-1) + a(n-2) + 5. - _Zak Seidov_, Jun 27 2010
%F A167616 a(5)=0, a(6)=3, a(7)=8, a(n) = 2*a(n-1) - a(n-3). - _Harvey P. Dale_, Dec 31 2011
%F A167616 G.f.: x^6*(3+2*x)/((1-x)*(1-x-x^2)). - _L. Edson Jeffery_, Mar 17 2013
%t A167616 Fibonacci[Range[5,45]]-5 (* or *) LinearRecurrence[{2,0,-1},{0,3,8},40] (* _Harvey P. Dale_, Dec 31 2011 *)
%o A167616 (Magma) [(Fibonacci(n) - 5): n in [5..45]]; // _Vincenzo Librandi_, Apr 23 2011
%o A167616 (PARI) a(n)=fibonacci(n)-5 \\ _Charles R Greathouse IV_, Jul 01 2013
%o A167616 (Sage) [fibonacci(n)-5 for n in (5..45)] # _G. C. Greubel_, Jul 13 2019
%o A167616 (GAP) List([5..45], n-> Fibonacci(n)-5); # _G. C. Greubel_, Jul 13 2019
%Y A167616 Cf. A000045, A001611, A000071, A157725, A001911, A157726, A006327, A157727, A157728, A157729, A167616.
%K A167616 nonn,easy
%O A167616 5,2
%A A167616 _N. J. A. Sloane_, Jun 26 2010