cp's OEIS Frontend

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.

A033937 Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 3.

This page as a plain text file.
%I A033937 #7 Sep 08 2022 08:44:51
%S A033937 2,7,17,35,66,118,204,345,575,949,1556,2540,4134,6715,10893,17655,
%T A033937 28598,46306,74960,121325,196347,317737,514152,831960,1346186,2178223,
%U A033937 3524489,5702795,9227370,14930254,24157716
%N A033937 Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 3.
%H A033937 G. C. Greubel, <a href="/A033937/b033937.txt">Table of n, a(n) for n = 0..1000</a>
%H A033937 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A033937 a(n) = Fibonacci(n+7) - (11+3*n).
%F A033937 G.f.: (2+x)/((1-x-x^2)*(1-x)^2).
%t A033937 Table[Fibonacci[n+7] -3*n-11, {n,0,40}] (* _G. C. Greubel_, Jul 05 2019 *)
%o A033937 (PARI) vector(40, n, n--; fibonacci(n+7) -3*n-11) \\ _G. C. Greubel_, Jul 05 2019
%o A033937 (Magma) [Fibonacci(n+7) -3*n-11: n in [0..40]]; // _G. C. Greubel_, Jul 05 2019
%o A033937 (Sage) [fibonacci(n+7) -3*n-11 for n in (0..40)] # _G. C. Greubel_, Jul 05 2019
%o A033937 (GAP) List([0..40], n-> Fibonacci(n+7) -3*n-11) # _G. C. Greubel_, Jul 05 2019
%Y A033937 Cf. A000045, A001924, A001891.
%K A033937 easy,nonn
%O A033937 0,1
%A A033937 _Wolfdieter Lang_