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 A037140 #13 Sep 08 2022 08:44:52
%S A037140 5,18,44,91,172,308,533,902,1504,2483,4072,6648,10821,17578,28516,
%T A037140 46219,74868,121228,196245,317630,514040,831843,1346064,2178096,
%U A037140 3524357,5702658,9227228,14930107,24157564,39087908,63245717,102333878,165579856,267914003
%N A037140 Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), for k >= 5.
%H A037140 G. C. Greubel, <a href="/A037140/b037140.txt">Table of n, a(n) for n = 0..1000</a>
%H A037140 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A037140 a(n) = Fibonacci(n+9) - (29+8*n).
%F A037140 G.f.: (5+3*x)/((1-x-x^2)*(1-x)^2).
%t A037140 Table[Fibonacci[n+9] -8*n-29, {n,0,40}] (* _G. C. Greubel_, Jul 05 2019 *)
%o A037140 (PARI) vector(40, n, n--; fibonacci(n+9) -8*n-29) \\ _G. C. Greubel_, Jul 05 2019
%o A037140 (Magma) [Fibonacci(n+9) -8*n-29: n in [0..40]]; // _G. C. Greubel_, Jul 05 2019
%o A037140 (Sage) [fibonacci(n+9) -8*n-29 for n in (0..40)] # _G. C. Greubel_, Jul 05 2019
%o A037140 (GAP) List([0..40], n-> Fibonacci(n+9) -8*n-29) # _G. C. Greubel_, Jul 05 2019
%Y A037140 Cf. A000045, A001924, A001891, A033937, A033960.
%K A037140 easy,nonn
%O A037140 0,1
%A A037140 _Wolfdieter Lang_
%E A037140 Corrected by _Franklin T. Adams-Watters_, Oct 25 2006