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 A037157 #13 Jun 30 2025 14:59:46
%S A037157 8,29,71,147,278,498,862,1459,2433,4017,6588,10756,17508,28441,46139,
%T A037157 74783,121138,196150,317530,513935,831733,1345949,2177976,3524232,
%U A037157 5702528,9227093,14929967,24157419,39087758,63245562,102333718
%N A037157 Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), for k >= 6.
%H A037157 G. C. Greubel, <a href="/A037157/b037157.txt">Table of n, a(n) for n = 0..1000</a>
%H A037157 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A037157 a(n) = Fibonacci(n+10) - (47+13*n).
%F A037157 G.f.: (8+5*x)/((1-x-x^2)*(1-x)^2).
%t A037157 Table[Fibonacci[n+10] -13*n-47, {n,0,40}] (* _G. C. Greubel_, Jul 05 2019 *)
%t A037157 LinearRecurrence[{3,-2,-1,1},{8,29,71,147},40] (* _Harvey P. Dale_, Jun 30 2025 *)
%o A037157 (PARI) vector(40, n, n--; fibonacci(n+10) -13*n-47) \\ _G. C. Greubel_, Jul 05 2019
%o A037157 (Magma) [Fibonacci(n+10) -13*n-47: n in [0..40]]; // _G. C. Greubel_, Jul 05 2019
%o A037157 (Sage) [fibonacci(n+10) -13*n-47 for n in (0..40)] # _G. C. Greubel_, Jul 05 2019
%o A037157 (GAP) List([0..40], n-> Fibonacci(n+10) -13*n-47); # _G. C. Greubel_, Jul 05 2019
%Y A037157 Cf. A000045, A037140.
%K A037157 easy,nonn
%O A037157 0,1
%A A037157 _Wolfdieter Lang_